[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 order.

You may assume no duplicates in the array.

Here are few examples.
[1,3,5,6], 5 → 2
[1,3,5,6], 2 → 1
[1,3,5,6], 7 → 4
[1,3,5,6], 0 → 0

 

思路：设个从0开始的游标positoin，如果position位置上的数小于target就递增。如果出现大于或等于nums[position]的，就返回position为位置

1 class Solution {
2     public int searchInsert(int[] nums, int target) {
3         int position = 0;
4         while(position<nums.length&&nums[position]<target)
5             position++;
6         return position;
7     }
8 }

 

转载于:https://www.cnblogs.com/David-Lin/p/7736211.html