上班无聊就在leetCode刷刷题目，有点遗憾的是到现在才去刷算法题，大学那会好好利用该多好啊。
第35道简单算法题，一次性通过有点开心，分享自己的代码。
问题描述
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
我的解题
class Solution {
public int searchInsert(int[] nums, int target) {
for(int i = 0; i < nums.length; i++){
if(nums[i] >= target){
return i;
}
}
return nums.length;
}
}
加了6行代码，仅供参考
LeetCode 35. Search Insert Position (Easy)
原文：http://www.cnblogs.com/brian-csyy/p/7567497.html