- 博客(3)
- 资源 (3)
- 收藏
- 关注
原创 80. Remove Duplicates from Sorted Array II
Follow up for "Remove Duplicates": What if duplicates are allowed at most twice? For example, Given sorted array nums = [1,1,1,2,2,3], Your function should return length = 5, with the first fi
2016-01-19 14:58:30 284
原创 95. Unique Binary Search Trees II
Given n, generate all structurally unique BST's (binary search trees) that store values 1...n. For example, Given n = 3, your program should return all 5 unique BST's shown below. 1 3
2016-01-19 14:01:19 325
原创 105. Construct Binary Tree from Preorder and Inorder Traversal
Given preorder and inorder traversal of a tree, construct the binary tree. Note: You may assume that duplicates do not exist in the tree. 根据先序序列和中序序列构建改二叉树 思路:根据先序序列确定树的根值,在中续序列中根值左侧的序列的为左
2016-01-10 22:14:44 325
CUDA编程指南
2016-04-18
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人