LeetCode 35 — Search Insert Position（C++ Java Python）

题目：http://oj.leetcode.com/problems/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.

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

题目翻译：

给定一个有序数组和一个目标值，如果找到目标则返回索引。如果没有，则返回把它插入时所在位置的索引。
假设数组中没有重复元素。
上面是一些例子。

分析：
        类似二分查找
C++实现：

class Solution {
public:
    int searchInsert(int A[], int n, int target) {
    //  if(n == 0)
    // 	{
    // 		return 0;
    // 	}

    	int left = 0;
    	int right = n - 1;
    	int mid = 0;

    	while(left <= right)
    	{
    		mid = (left + right) / 2;
    		if(A[mid] > target)
    		{
    			right = mid - 1;
    		}
    		else if(A[mid] < target)
    		{
    			left = mid + 1;
    		}
    		else
    		{
    			return mid;
    		}
    	}

    	return left;
    }
};

Java实现：

public class Solution {
    public int searchInsert(int[] A, int target) {
        int left = 0;
		int right = A.length - 1;
		int mid = 0;

		while (left <= right) {
			mid = (left + right) / 2;
			if (A[mid] > target) {
				right = mid - 1;
			} else if (A[mid] < target) {
				left = mid + 1;
			} else {
				return mid;
			}
		}

		return left;
    }
}

Python实现：

class Solution:
    # @param A, a list of integers
    # @param target, an integer to be inserted
    # @return integer
    def searchInsert(self, A, target):
        left = 0
        right = len(A) - 1
        
        while left <= right:
            mid = (left + right) / 2
            if A[mid] > target:
                right = mid - 1
            elif A[mid] < target:
                left = mid + 1
            else:
                return mid
            
        return left

        感谢阅读，欢迎评论！