2017年7月15日
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-07-15 04:35 Jimmy_Cheng 阅读(174) 评论(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-07-15 03:54 Jimmy_Cheng 阅读(282) 评论(0) 推荐(0)