[LeetCode] Search Insert Position

Problem : 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

1.C++版

class Solution {public:    int searchInsert(int A[], int n, int target) {        int left = 0,right = n-1,middle = 0;        while(left <= right){            middle = left + (right - left) / 2;            if(target == A[middle]){                return middle;            }else if(target > A[middle]){                left = middle + 1;            }else{                right = middle - 1;            }        }                if(target > A[middle]){            return middle + 1;        }else{            return middle;        }    }};

2.Java版

public class Solution {    public int searchInsert(int[] A, int target) {        int left = 0,right = A.length -1 ,middle = 0;        while(left <= right){            middle = left + (right - left) / 2;            if(target == A[middle]){                return middle;            }else if(target > A[middle]){                left = middle + 1;            }else{                right = middle - 1;            }        }                if(target > A[middle]){            return middle + 1;        }else{            return middle;        }    }}

3.Python版

待续

完