Miller1991

2016年7月7日

摘要： Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of 阅读全文

posted @ 2016-07-07 17:22 Miller1991 阅读(182) 评论(0) 推荐(0) 编辑

79. Word Search java solutions

摘要： Given a 2D board and a word, find if the word exists in the grid. The word can be constructed from letters of sequentially adjacent cell, where "adjac 阅读全文

posted @ 2016-07-07 16:51 Miller1991 阅读(190) 评论(0) 推荐(0) 编辑

2016年7月6日

80. Remove Duplicates from Sorted Array II java solutions

摘要： Follow up for "Remove Duplicates":What if duplicates are allowed at most twice? For example,Given sorted array nums = [1,1,1,2,2,3], Your function sho 阅读全文

posted @ 2016-07-06 14:54 Miller1991 阅读(115) 评论(0) 推荐(0) 编辑

34. Search for a Range java solutions

摘要： Given a sorted array of integers, find the starting and ending position of a given target value. Your algorithm's runtime complexity must be in the or 阅读全文

posted @ 2016-07-06 14:35 Miller1991 阅读(127) 评论(0) 推荐(0) 编辑

119. Pascal's Triangle II java solutions

摘要： Given an index k, return the kth row of the Pascal's triangle. For example, given k = 3,Return [1,3,3,1]. Note:Could you optimize your algorithm to us 阅读全文

posted @ 2016-07-06 11:36 Miller1991 阅读(150) 评论(0) 推荐(0) 编辑

118. Pascal's Triangle java solutions

摘要： For example, given numRows = 5,Return Subscribe to see which companies asked this question 1 public class Solution { 2 public List<List<Integer>> gene 阅读全文

posted @ 2016-07-06 11:06 Miller1991 阅读(160) 评论(0) 推荐(0) 编辑

209. Minimum Size Subarray Sum java solutions

摘要： Given an array of n positive integers and a positive integer s, find the minimal length of a subarray of which the sum ≥ s. If there isn't one, return 阅读全文

posted @ 2016-07-06 10:20 Miller1991 阅读(108) 评论(0) 推荐(0) 编辑

228. Summary Ranges java solutions

摘要： 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"]. Credi 阅读全文

posted @ 2016-07-06 09:46 Miller1991 阅读(177) 评论(0) 推荐(0) 编辑

2016年7月5日

189. Rotate Array java solutions

摘要： Rotate an array of n elements to the right by k steps. For example, with n = 7 and k = 3, the array [1,2,3,4,5,6,7] is rotated to [5,6,7,1,2,3,4]. Not 阅读全文

posted @ 2016-07-05 17:41 Miller1991 阅读(177) 评论(0) 推荐(0) 编辑

229. Majority Element II java solutions

摘要： Given an integer array of size n, find all elements that appear more than ⌊ n/3 ⌋ times. The algorithm should run in linear time and in O(1) space. Hi 阅读全文

posted @ 2016-07-05 17:18 Miller1991 阅读(179) 评论(0) 推荐(0) 编辑

公告