2015年7月31日

238. Product of Array Except Self

摘要: Given an array ofnintegers wheren> 1,nums, return an arrayoutputsuch thatoutput[i]is equal to the product of all the elements ofnumsexceptnums[i].Solv... 阅读全文

posted @ 2015-07-31 07:14 shini 阅读(109) 评论(0) 推荐(0) 编辑

235. Lowest Common Ancestor of a Binary Search Tree

摘要: Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST.According to thedefinition of LCA on Wikipedia: ... 阅读全文

posted @ 2015-07-31 04:58 shini 阅读(120) 评论(0) 推荐(0) 编辑

234. Palindrome Linked List

摘要: Given a singly linked list, determine if it is a palindrome.Follow up:Could you do it in O(n) time and O(1) space?先找到链表中点,将第二部分反转,然后比较两部分链表的值。/** * De... 阅读全文

posted @ 2015-07-31 00:56 shini 阅读(163) 评论(0) 推荐(0) 编辑

2015年7月11日

232. Implement Queue using Stacks

摘要: Implement the following operations of a queue using stacks.push(x) -- Push element x to the back of queue.pop() -- Removes the element from in front o... 阅读全文

posted @ 2015-07-11 06:43 shini 阅读(100) 评论(0) 推荐(0) 编辑

231. Power of Two

摘要: Given an integer, write a function to determine if it is a power of two.Credits:Special thanks to@jianchao.li.fighterfor adding this problem and creat... 阅读全文

posted @ 2015-07-11 06:35 shini 阅读(205) 评论(0) 推荐(0) 编辑

2015年7月1日

58. Length of Last Word

摘要: Given a stringsconsists of upper/lower-case alphabets and empty space characters' ', return the length of last word in the string.If the last word doe... 阅读全文

posted @ 2015-07-01 11:00 shini 阅读(165) 评论(0) 推荐(0) 编辑

2015年6月27日

228. Summary Ranges

摘要: Given a sorted integer array without duplicates, return the summary of its ranges.For example, given[0,1,2,4,5,7], return["0->2","4->5","7"].Credits:S... 阅读全文

posted @ 2015-06-27 08:53 shini 阅读(124) 评论(0) 推荐(0) 编辑

2015年6月25日

55. Jump Game && 45. Jump Game II

摘要: Jump GameGiven an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents yo... 阅读全文

posted @ 2015-06-25 09:26 shini 阅读(100) 评论(0) 推荐(0) 编辑

53. Maximum Subarray

摘要: Find the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array[−2,1,−3,4,−1,2,1,... 阅读全文

posted @ 2015-06-25 09:08 shini 阅读(86) 评论(0) 推荐(0) 编辑

2015年6月18日

Permutations

摘要: Given a collection of numbers, return all possible permutations.For example,[1,2,3]have the following permutations:[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,... 阅读全文

posted @ 2015-06-18 07:54 shini 阅读(118) 评论(0) 推荐(0) 编辑

导航