2014年11月22日
Search in Rotated Sorted Array II
摘要： Follow up for "Search in Rotated Sorted Array":What ifduplicatesare allowed?Would this affect the run-time complexity? How and why?Write a function to... 阅读全文
posted @ 2014-11-22 21:21 Jessica程序猿 阅读(155) 评论(0) 推荐(0)
Search in Rotated Sorted Array
摘要： Suppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e.,0 1 2 4 5 6 7might become4 5 6 7 0 1 2).You are given a target value t... 阅读全文
posted @ 2014-11-22 21:09 Jessica程序猿 阅读(170) 评论(0) 推荐(0)
Find Minimum in Rotated Sorted Array II
摘要： Follow upfor "Find Minimum in Rotated Sorted Array":What ifduplicatesare allowed?Would this affect the run-time complexity? How and why?Suppose a sort... 阅读全文
posted @ 2014-11-22 18:55 Jessica程序猿 阅读(185) 评论(0) 推荐(0)
Minimum Depth of Binary Tree
摘要： Given a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path from the root node down to the nearest le... 阅读全文
posted @ 2014-11-22 16:08 Jessica程序猿 阅读(192) 评论(0) 推荐(0)
Binary Tree Postorder Traversal
摘要： Given a binary tree, return thepostordertraversal of its nodes' values.For example:Given binary tree{1,#,2,3}, 1 \ 2 / 3return[3,2,1].C+... 阅读全文
posted @ 2014-11-22 08:23 Jessica程序猿 阅读(174) 评论(0) 推荐(0)