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.
Example 1:
Input: [1,3,5,6], 5 Output: 2
Example 2:
Input: [1,3,5,6], 2 Output: 1
Example 3:
Input: [1,3,5,6], 7 Output: 4
Example 1:
Input: [1,3,5,6], 0 Output: 0
我的思路:
这道题目比较简单,首先扫描数组看其中是否有target元素,如果有的话返回数组下标,如果没有target再重新扫描一遍数组,找到target合适的插入位置并返回下标。
我的解决:
class Solution {
public int searchInsert(int[] nums, int target) {
int i, j;
for (i = 0; i < nums.length; i++){
if(nums[i] == target)
return i;
}
if(i == nums.length){
for (j = 0; j < nums.length; j++){
if(nums[0] > target)
return 0;
if(nums[j] > target)
return j;
}
if(j == nums.length)
return j;
}
return 0;
}
}