2015年1月18日
[LeetCode#35]Search Insert Position
摘要： The problem: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 in... 阅读全文
posted @ 2015-01-18 04:59 airforce 阅读(167) 评论(0) 推荐(0)
[LeetCode#154]Find Minimum in Rotated Sorted Array II
摘要： The question:Follow upfor "Find Minimum in Rotated Sorted Array":What ifduplicatesare allowed?Would this affect the run-time complexity? How and why?S... 阅读全文
posted @ 2015-01-18 04:21 airforce 阅读(158) 评论(0) 推荐(0)