Miller1991

2016年6月25日

摘要： A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below). The robot can only move either down or right at any p 阅读全文

posted @ 2016-06-25 16:32 Miller1991 阅读(152) 评论(0) 推荐(0)

53. Maximum Subarray java solutions

摘要： 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, 阅读全文

posted @ 2016-06-25 16:17 Miller1991 阅读(122) 评论(0) 推荐(0)

2016年6月24日

257. Binary Tree Paths java solutions

摘要： Given a binary tree, return all root-to-leaf paths. For example, given the following binary tree: All root-to-leaf paths are: Credits:Special thanks t 阅读全文

posted @ 2016-06-24 17:40 Miller1991 阅读(118) 评论(0) 推荐(0)

216. Combination Sum III java solutions

摘要： Find all possible combinations of k numbers that add up to a number n, given that only numbers from 1 to 9 can be used and each combination should be 阅读全文

posted @ 2016-06-24 12:03 Miller1991 阅读(158) 评论(0) 推荐(0)

203. Remove Linked List Elements java solutions

摘要： Remove all elements from a linked list of integers that have value val. ExampleGiven: 1 --> 2 --> 6 --> 3 --> 4 --> 5 --> 6, val = 6Return: 1 --> 2 -- 阅读全文

posted @ 2016-06-24 11:33 Miller1991 阅读(111) 评论(0) 推荐(0)

2016年6月23日

35. Search Insert Position java solutions

摘要： Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in or 阅读全文

posted @ 2016-06-23 17:16 Miller1991 阅读(121) 评论(0) 推荐(0)

108. Convert Sorted Array to Binary Search Tree java solutions

摘要： Given an array where elements are sorted in ascending order, convert it to a height balanced BST. Subscribe to see which companies asked this question 阅读全文

posted @ 2016-06-23 16:43 Miller1991 阅读(104) 评论(0) 推荐(0)

22. Generate Parentheses java solutions

摘要： Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. For example, given n = 3, a solution set is: S 阅读全文

posted @ 2016-06-23 16:26 Miller1991 阅读(123) 评论(0) 推荐(0)

96. Unique Binary Search Trees java solutions

摘要： Given n, how many structurally unique BST's (binary search trees) that store values 1...n? For example,Given n = 3, there are a total of 5 unique BST' 阅读全文

posted @ 2016-06-23 15:46 Miller1991 阅读(124) 评论(0) 推荐(0)

137. Single Number II java solutions

摘要： 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 c 阅读全文

posted @ 2016-06-23 11:45 Miller1991 阅读(117) 评论(0) 推荐(0)

公告