Leetcode
文章平均质量分 54
完美世界xx
Happiness is more than pleasure without pain
展开
-
Reverse Integer
Reverse digits of an integer.Example1: x = 123, return 321Example2: x = -123, return -321原创 2014-09-20 10:04:34 · 341 阅读 · 0 评论 -
Single Number II
Given an array of integers, every element appears three times except for one. Find that single one.Note:Your algorithm should have a linear runtime complexity. Could you implement it without u原创 2015-04-01 13:20:30 · 379 阅读 · 0 评论 -
Minimum Depth of Binary Tree
Given a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.直接将最深二叉树的代码稍微改下,是错的,分析特定例子,当遇到有结点为NU原创 2015-04-03 21:12:45 · 420 阅读 · 0 评论 -
Binary Tree Preorder Traversal
Given a binary tree, return the preorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3}, 1 \ 2 / 3return [1,2,3].Note: Recursive soluti原创 2015-04-02 12:05:14 · 265 阅读 · 0 评论 -
Binary Tree Level Order Traversal
Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).For example:Given binary tree {3,9,20,#,#,15,7}, 3 / \ 9 20原创 2015-04-03 12:21:30 · 334 阅读 · 0 评论 -
Linked List Cycle II
Given a linked list, return the node where the cycle begins. If there is no cycle, return null.Follow up:Can you solve it without using extra space?/** * Definition for singly-linked l原创 2015-03-26 23:17:04 · 276 阅读 · 0 评论 -
动态规划求最大子段和
for(int i=1;isum+=a[i];if(sum>Max){Max=sum;start=l;end=i;}if(sum<0){sum=0;l=i+1;}原创 2014-09-10 08:46:35 · 413 阅读 · 0 评论 -
Product of Array Exclude Itself
Given an integers array A.Define B[i] = A[0] * ... * A[i-1] * A[i+1] * ... * A[n-1], calculate B WITHOUT divide operation.ExampleFor A=[1, 2, 3], return [6, 3, 2].public class Solution原创 2015-05-17 09:21:51 · 457 阅读 · 0 评论 -
不同的路径
不同的路径40%通过有一个机器人的位于一个M×N个网格左上角(下图中标记为'Start')。机器人每一时刻只能向下或者向右移动一步。机器人试图达到网格的右下角(下图中标记为'Finish')。问有多少条不同的路径?样例1,11,21,31,41,51,6转载 2015-05-17 20:49:40 · 1473 阅读 · 1 评论 -
加油站
在一条环路上有 N 个加油站,其中第 i 个加油站有汽油gas[i],并且从第_i_个加油站前往第_i_+1个加油站需要消耗汽油cost[i]。你有一辆油箱容量无限大的汽车,现在要从某一个加油站出发绕环路一周,一开始油箱为空。求可环绕环路一周时出发的加油站的编号,若不存在环绕一周的方案,则返回-1。样例现在有4个加油站,汽油量gas[i]=[1, 1, 3, 1原创 2015-05-17 22:03:30 · 795 阅读 · 0 评论 -
Majority Number
Given an array of integers, the majority number is the number that occurs more than half of the size of the array. Find it.ExampleGiven [1, 1, 1, 1, 2, 2, 2], return 1Challenge原创 2015-05-17 22:14:19 · 472 阅读 · 0 评论 -
Maximum Depth of Binary Tree
Given a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.////Definition for binary tree原创 2014-09-20 08:34:32 · 410 阅读 · 0 评论 -
Binary Tree Inorder Traversal
Given a binary tree, return the inorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3}, 1 \ 2 / 3return [1,3,2].Note: Recursive solutio原创 2015-04-02 12:49:39 · 324 阅读 · 0 评论 -
SingleNumber
Given an array of integers, every element appears twice except for one. Find that single one.Note:Your algorithm should have a linear runtime complexity. Could you implement it without using ext转载 2014-09-16 22:59:41 · 351 阅读 · 0 评论 -
Same Tree
Given two binary trees, write a function to check if they are equal or not.Two binary trees are considered equal if they are structurally identical and the nodes have the same value.转载 2014-09-17 07:17:08 · 344 阅读 · 0 评论 -
RemoveDuplicatesfromSortedArray
public class Solution { public int removeDuplicates(int[] A) { int j=1;//快慢指针 if(A==null)return 0; if(A.length for( int i=1;i if(A[i]!=A[i-1]){ A[j++]=A[i]; }原创 2014-10-16 22:08:38 · 375 阅读 · 0 评论 -
Remove Duplicates from Sorted Array II
Follow up for "Remove Duplicates":What if duplicates are allowed at most twice?For example,Given sorted array A = [1,1,1,2,2,3],Your function should return length = 5, and A is now [1,原创 2014-10-17 12:31:06 · 313 阅读 · 0 评论 -
Search in Rotated Sorted Array
public class Solution {public int search(int[] A,int target){int first=0,mid,last=A.length;while(first!=last){mid=(first+last)/2;if(target==A[mid])return mid;if (A[first] if (A[first原创 2014-10-18 09:12:28 · 369 阅读 · 0 评论 -
Linked List Cycle
//快慢指针public class Solution {public boolean hasCycle(ListNode head) {if(head==null)return false;ListNode slow=head;ListNode fast=head;do{if(fast==null||fast.next==null)return false;f原创 2015-03-26 22:34:22 · 291 阅读 · 0 评论 -
Implement strStr()
Implement strStr().Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.Update (2014-11-02):The signature of the function had been updat原创 2015-03-27 13:50:05 · 370 阅读 · 0 评论 -
Single Number II
Given an array of integers, every element appears three times except for one. Find that single one.Note:Your algorithm should have a linear runtime complexity. Could you implement it without usi原创 2015-03-27 19:18:51 · 432 阅读 · 0 评论 -
跳跃游戏
给出一个非负整数数组,你最初定位在数组的第一个位置。 数组中的每个元素代表你在那个位置可以跳跃的最大长度。 判断你是否能到达数组的最后一个位置。样例A = [2,3,1,1,4],返回 true.A = [3,2,1,0,4],返回 false.//二指针问题,最大覆盖区间。public class Solution { /**原创 2015-05-17 23:45:17 · 635 阅读 · 0 评论