35. Search Insert Position

题目：https://leetcode.com/problemset/algorithms/#

代码：

public class Solution {    public int searchInsert(int[] nums, int target) {        int i;        for(i=0;i<nums.length;i++)        {            if(nums[i]>target)                break;        }        if(i>0&&nums[i-1]==target)            return i-1;        return i;    }}