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.
【leetcode刷题|【leetcode每日刷题】35. Search Insert Position】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

class num35{ public int searchInsert(int[] nums, int target) { for(int i=0; i


    推荐阅读