2015年8月24日
(leetcode)Missing Number
Given an array containingndistinct numbers taken from0, 1, 2, ..., n, find the one that is missing from the array.For example,Givennums=[0, 1, 3]retur... Read More
posted @ 2015-08-24 17:33 sunalive Views(132) Comments(0) Diggs(0)
(leetcode)Minimum Size Subarray Sum
Given an array ofnpositive integers and a positive integers, find the minimal length of a subarray of which the sum ≥s. If there isn't one, return 0 i... Read More
posted @ 2015-08-24 11:14 sunalive Views(144) Comments(0) Diggs(0)
(leetcode)Add Digits
Given a non-negative integernum, repeatedly add all its digits until the result has only one digit.For example:Givennum = 38, the process is like:3 + ... Read More
posted @ 2015-08-24 10:03 sunalive Views(197) Comments(0) Diggs(0)