- 博客(4)
- 收藏
- 关注
RSS订阅原创 【LeetCode】268. Missing Number
Given an array containing n distinct numbers taken from 0, 1, 2, ..., n, find the one that is missing from the array. For example, Given nums = [0, 1, 3] return 2. Note: Your algorithm sho
2016-05-31 16:20:45
220
原创 【LeetCode】96. Unique Binary Search Trees
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's. 1 3 3 2 1 \
2016-05-30 15:33:02
179
原创 【LeetCode】238. Product of Array Except Self
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 elements of nums except nums[i]. Solve it without division and in O
2016-05-30 11:51:09
267
原创 【LeetCode】338. Counting Bits
Given a non negative integer number num. For every numbers i in the range 0 ≤ i ≤ num calculate the number of 1's in their binary representation and return them as an array. Example: For num = 5
2016-05-27 10:26:06
184
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人