- 博客(3)
- 收藏
- 关注
RSS订阅原创 [leetCode] Contains Duplicate II
Given an array of integers and an integer k, find out whether there there are two distinct indices i and j in the array such that nums[i] = nums[j] and the difference between iand j is at most
2015-06-18 22:28:29
288
原创 [leetCode] Contains Duplicate
Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the array, and it should return false if every element
2015-06-18 22:27:10
272
原创 [leetCode] Combination Sum III
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 a unique set of numbers. Ensure that numbers wi
2015-06-18 22:25:20
277
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人