查找
SYSU_xiandan
Life is like a dream.
展开
-
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 complexity must be in the order of O(log n).If the原创 2017-12-10 11:40:19 · 123 阅读 · 0 评论 -
35. Search Insert Position
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 inserted in order.You may assume no duplicates in原创 2017-09-08 01:05:06 · 214 阅读 · 0 评论 -
74. Search a 2D Matrix
Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:Integers in each row are sorted from left to right.The first integer of each原创 2017-12-10 19:20:04 · 2044 阅读 · 0 评论