LeetCode之路——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.
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 4:

Input: [1,3,5,6], 0
Output: 0

7ms
思路：一个for解决
其实用2个for比一个for两个if快1ms。。。
class Solution {

    public int searchInsert(int[] nums, int target) {

        
    int index = 0;
   
    for(int i = 0;i < nums.length;i++) {
    if(target > nums[i]) {
    index++;   

    }
    if(target <= nums[i]) {
    return index;
    }
   
    }
        
    return index;

    }

}