2017年1月17日
【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 @ 2017-01-17 14:08 wilderness 阅读(127) 评论(0) 推荐(0)
【LeetCode】34. Search for a Range
摘要： Given an array of integers sorted in ascending order, find the starting and ending position of a given target value. Your algorithm's runtime complexi 阅读全文
posted @ 2017-01-17 13:44 wilderness 阅读(149) 评论(0) 推荐(0)
【LeetCode】33. Search in Rotated Sorted Array
摘要： Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2). You a 阅读全文
posted @ 2017-01-17 10:41 wilderness 阅读(165) 评论(0) 推荐(0)