上一页 1 ··· 15 16 17 18 19 20 21 22 23 ··· 29 下一页
2013年12月17日
Populating Next Right Pointers in Each Node II
摘要： Follow up for problem "Populating Next Right Pointers in Each Node".What if the given tree could be any binary tree? Would your previous solution stil... 阅读全文
posted @ 2013-12-17 00:18 海滨银枪小霸王 阅读(122) 评论(0) 推荐(0)
2013年12月16日
Populating Next Right Pointers in Each Node
摘要： Given a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; }Populate each next pointe... 阅读全文
posted @ 2013-12-16 23:50 海滨银枪小霸王 阅读(126) 评论(0) 推荐(0)
Search Insert Position
摘要： Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in or... 阅读全文
posted @ 2013-12-16 23:25 海滨银枪小霸王 阅读(91) 评论(0) 推荐(0)
Unique Binary Search Trees
摘要： Givenn, how many structurally uniqueBST's(binary search trees) that store values 1...n?For example,Givenn= 3, there are a total of 5 unique BST's. 1... 阅读全文
posted @ 2013-12-16 23:15 海滨银枪小霸王 阅读(100) 评论(0) 推荐(0)
ffmpeg开发中的问题(十一)
摘要： 今天开发一个blackmagic的程序, 要用到ffmpeg的编码库当然,对于视频,很好处理, 没一上午,就得到了清晰可见的视频, 甚是满意.但处理音频时颇费周折,具体曲折如下:1. 硬件不支持 blackmagic的产品各异, 有的支持获取声音, 有的不支持, 虽然用到的板卡可以抓取声音,... 阅读全文
posted @ 2013-12-16 21:06 海滨银枪小霸王 阅读(689) 评论(0) 推荐(0)
2013年12月15日
Path Sum II
摘要： Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.For example:Given the below binary tree andsum =... 阅读全文
posted @ 2013-12-15 22:35 海滨银枪小霸王 阅读(103) 评论(0) 推荐(0)
Path Sum
摘要： Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.Fo... 阅读全文
posted @ 2013-12-15 21:58 海滨银枪小霸王 阅读(129) 评论(0) 推荐(0)
Minimum Path Sum
摘要： Given amxngrid filled with non-negative numbers, find a path from top left to bottom right whichminimizesthe sum of all numbers along its path.Note:Yo... 阅读全文
posted @ 2013-12-15 19:32 海滨银枪小霸王 阅读(102) 评论(0) 推荐(0)
Plus One
摘要： Given a number represented as an array of digits, plus one to the number.class Solution {public: vector plusOne(vector &digits) { int len... 阅读全文
posted @ 2013-12-15 12:01 海滨银枪小霸王 阅读(153) 评论(0) 推荐(0)
Unique Paths II
摘要： Follow up for "Unique Paths":Now consider if some obstacles are added to the grids. How many unique paths would there be?An obstacle and empty space i... 阅读全文
posted @ 2013-12-15 11:30 海滨银枪小霸王 阅读(130) 评论(0) 推荐(0)
上一页 1 ··· 15 16 17 18 19 20 21 22 23 ··· 29 下一页