~每天进步一点点~

2015年8月2日

摘要： Compare two version numbersversion1andversion2.Ifversion1>version2return 1, ifversion1len2){ for(int i=len2;i0?1:-1; return 0; }} 阅读全文

posted @ 2015-08-02 15:22 ~每天进步一点点~ 阅读(119) 评论(0) 推荐(0) 编辑

[leedcode 164] Maximum Gap

摘要： Given an unsorted array, find the maximum difference between the successive elements in its sorted form.Try to solve it in linear time/space.Return 0 ... 阅读全文

posted @ 2015-08-02 12:30 ~每天进步一点点~ 阅读(135) 评论(0) 推荐(0) 编辑

[leedcode 162] Find Peak Element

摘要： A peak element is an element that is greater than its neighbors.Given an input array wherenum[i] ≠ num[i+1], find a peak element and return its index.... 阅读全文

posted @ 2015-08-02 11:20 ~每天进步一点点~ 阅读(125) 评论(0) 推荐(0) 编辑

2015年8月1日

[leedcode 160] Intersection of Two Linked Lists

摘要： Write a program to find the node at which the intersection of two singly linked lists begins.For example, the following two linked lists:A: a... 阅读全文

posted @ 2015-08-01 22:50 ~每天进步一点点~ 阅读(120) 评论(0) 推荐(0) 编辑

[leedcode 155] Min Stack

摘要： Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.push(x) -- Push element x onto stack.pop() -- Removes... 阅读全文

posted @ 2015-08-01 22:29 ~每天进步一点点~ 阅读(98) 评论(0) 推荐(0) 编辑

[leedcode 154] Find Minimum in Rotated Sorted Array II

摘要： Follow upfor "Find Minimum in Rotated Sorted Array":What ifduplicatesare allowed?Would this affect the run-time complexity? How and why?Suppose a sort... 阅读全文

posted @ 2015-08-01 22:17 ~每天进步一点点~ 阅读(195) 评论(0) 推荐(0) 编辑

[leedcode 153] Find Minimum in Rotated Sorted Array

摘要： Suppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e.,0 1 2 4 5 6 7might become4 5 6 7 0 1 2).Find the minimum element.You m... 阅读全文

posted @ 2015-08-01 21:59 ~每天进步一点点~ 阅读(105) 评论(0) 推荐(0) 编辑

[leedcode 151] Reverse Words in a String

摘要： Given an input string, reverse the string word by word.For example,Given s = "the sky is blue",return "blue is sky the".Update (2015-02-12):For C prog... 阅读全文

posted @ 2015-08-01 21:38 ~每天进步一点点~ 阅读(124) 评论(0) 推荐(0) 编辑

[leedcode 150] Evaluate Reverse Polish Notation

摘要： Evaluate the value of an arithmetic expression inReverse Polish Notation.Valid operators are+,-,*,/. Each operand may be an integer or another express... 阅读全文

posted @ 2015-08-01 20:51 ~每天进步一点点~ 阅读(129) 评论(0) 推荐(0) 编辑

[leedcode 149] Max Points on a Line

摘要： Givennpoints on a 2D plane, find the maximum number of points that lie on the same straight line./** * Definition for a point. * class Point { * i... 阅读全文

posted @ 2015-08-01 18:37 ~每天进步一点点~ 阅读(155) 评论(0) 推荐(0) 编辑

公告