蓝色地中海

2017年5月19日

摘要： Problem statement: Given an array of n positive integers and a positive integer s, find the minimal length of a contiguous subarray of which the sum ≥ 阅读全文

posted @ 2017-05-19 03:14 蓝色地中海阅读(134) 评论(0) 推荐(0)

152. Maximum Product Subarray

摘要： Problem statement: Find the contiguous subarray within an array (containing at least one number) which has the largest product. For example, given the 阅读全文

posted @ 2017-05-19 02:42 蓝色地中海阅读(132) 评论(0) 推荐(0)

2017年5月18日

53. Maximum Subarray

摘要： Problem statement: Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For example, given the arr 阅读全文

posted @ 2017-05-18 23:42 蓝色地中海阅读(122) 评论(0) 推荐(0)

337. House Robber III

摘要： Problem statement: The thief has found himself a new place for his thievery again. There is only one entrance to this area, called the "root." Besides 阅读全文

posted @ 2017-05-18 05:17 蓝色地中海阅读(184) 评论(0) 推荐(0)

213. House Robber II

摘要： Problem statement: Note: This is an extension of House Robber. After robbing those houses on that street, the thief has found himself a new place for 阅读全文

posted @ 2017-05-18 01:51 蓝色地中海阅读(133) 评论(0) 推荐(0)

2017年5月17日

198. House Robber

摘要： Problem statement: You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only con 阅读全文

posted @ 2017-05-17 23:57 蓝色地中海阅读(205) 评论(0) 推荐(0)

436. Find Right Interval

摘要： Problem statement: Given a set of intervals, for each of the interval i, check if there exists an interval j whose start point is bigger than or equal 阅读全文

posted @ 2017-05-17 11:26 蓝色地中海阅读(240) 评论(0) 推荐(0)

319. Bulb Switcher

摘要： Problem statement: There are n bulbs that are initially off. You first turn on all the bulbs. Then, you turn off every second bulb. On the third round 阅读全文

posted @ 2017-05-17 09:17 蓝色地中海阅读(150) 评论(0) 推荐(0)

238. Product of Array Except Self

摘要： Problem statement: Given an array of n integers where n > 1, nums, return an array output such that output[i] is equal to the product of all the eleme 阅读全文

posted @ 2017-05-17 06:54 蓝色地中海阅读(104) 评论(0) 推荐(0)

2017年5月15日

300. Longest Increasing Subsequence

摘要： Problem statement Given an unsorted array of integers, find the length of longest increasing subsequence. For example,Given [10, 9, 2, 5, 3, 7, 101, 1 阅读全文

posted @ 2017-05-15 22:42 蓝色地中海阅读(185) 评论(0) 推荐(0)

每一个卓尔不群和追求梦想的背后总有一个非凡的故事

公告