LeetCode: Search Insert Position

一次过

class Solution {
public:
    int searchInsert(int A[], int n, int target) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        int left = 0;
        int right = n - 1;
        int mid;
        while (left <= right) {
            mid = (left + right) / 2;
            if (target == A[mid]) return mid;
            if (target > A[mid]) left = mid + 1;
            else right = mid - 1;
        }
        return right + 1;
    }
};

 C#

public class Solution {
    public int SearchInsert(int[] nums, int target) {
        int left = 0, right = nums.Length - 1;
        while (left <= right) {
            int mid = (left + right) / 2;
            if (target == nums[mid]) return mid;
            if (target > nums[mid]) left = mid + 1;
            else right = mid - 1;
        }
        return right + 1;
    }
}