2015年3月23日
【leetcode】Search for a Range（middle）
摘要： 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-03-23 14:29 匡子语 阅读(218) 评论(0) 推荐(0)
【leetcode】 search Insert Position（middle）
摘要： 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-03-23 10:34 匡子语 阅读(184) 评论(0) 推荐(0)