2015年8月31日

[LeetCode] 34 - Search for a Range

摘要： Given a sorted array of integers, find the starting and ending position of a given target value.Your algorithm's runtime complexity must be in the ord... 阅读全文

posted @ 2015-08-31 14:25 tuituji 阅读(118) 评论(0) 推荐(0) 编辑

[LeetCode] 35 - 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 @ 2015-08-31 11:05 tuituji 阅读(141) 评论(0) 推荐(0) 编辑

导航