- 博客(3)
- 收藏
- 关注
RSS订阅原创 LeetCode之Search in Rotated Sorted Array II （）C++
Follow up for “Search in Rotated Sorted Array”: What if duplicates are allowed?Would this affect the run-time complexity? How and why?Write a function to determine if a given target is in the array.
2015-04-25 21:29:15
286
原创 LeetCod之Search in Rotated Sorted Array （C++）
Suppose a sorted array 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 are given a target value to search. If found in the array return its index
2015-04-25 21:27:34
354
原创 LeetCode之Search Insert Position（C++）
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 the array. H
2015-04-25 16:28:04
359
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人