- 博客(9)
- 资源 (4)
- 收藏
- 关注
RSS订阅原创 使用Kinect SDK获取深度图与彩色图并保存
感谢http://blog.csdn.net/zouxy09#include #include #include #include "OpenNI.h"#include "opencv2/core/core.hpp"#include "opencv2/highgui/highgui.hpp"#include "opencv2/imgproc/imgproc.hpp"#in
2015-07-29 22:31:27
11835
6
转载 把二元查找树转变成排序的双向链表
题目：输入一棵二元查找树，将该二元查找树转换成一个排序的双向链表。要求不能创建任何新的结点，只调整指针的指向。 比如将二元查找树 10 / \
2015-07-16 18:30:54
357
原创 230.Kth Smallest Element in a BST
Given a binary search tree, write a function kthSmallest to find the kth smallest element in it.Note: You may assume k is always valid, 1 ≤ k ≤ BST's total elements.Follow up:What if the
2015-07-02 16:02:34
579
原创 135.Candy
There are N children standing in a line. Each child is assigned a rating value.You are giving candies to these children subjected to the following requirements:Each child must have at least on
2015-07-01 21:02:56
1123
原创 97.Interleaving String (二维动态规划，没想明白)
Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2.For example,Given:s1 = "aabcc",s2 = "dbbca",When s3 = "aadbbcbcac", return true.When s3 = "aadbbbaccc", r
2015-07-01 15:53:36
765
原创 149.Max Points on a Line
Given n points on a 2D plane, find the maximum number of points that lie on the same straight line.任意一条直线都可以表述为y = ax + b假设，有两个点(x1,y1), (x2,y2)，如果他们都在这条直线上则有y1 = kx1 +by2 = kx
2015-07-01 10:08:49
447
原创 179.Largest Number
Given a list of non negative integers, arrange them such that they form the largest number.For example, given [3, 30, 34, 5, 9], the largest formed number is 9534330.Note: The result may be ve
2015-07-01 08:57:29
482
原创 229.Majority Element II
Given an integer array of size n, find all elements that appear more than ⌊ n/3 ⌋ times. The algorithm should run in linear time and in O(1) space.Hint:How many majority elements could it poss
2015-07-01 08:53:07
1635
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人