- 博客(2)
- 收藏
- 关注
RSS订阅原创 【LeetCode】377. Combination Sum IV
Given an integer array with all positive numbers and no duplicates, find the number of possible combinations that add up to a positive integer target. Example: nums = [1, 2, 3] target = 4 The pos
2016-08-06 10:25:59
275
原创 【LeetCode】108. Convert Sorted Array to Binary Search Tree
Given an array where elements are sorted in ascending order, convert it to a height balanced BST. class Solution { public: TreeNode* build(vector& nums, int left, int right) { if (left >
2016-08-01 16:45:01
245
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人