LeetCode 34 — Search for a Range（C++ Java Python）

Given a sorted array of integers, find the starting and ending position of a given target value.

Your algorithm's runtime complexity must be in the order of O(log n).

If the target is not found in the array, return [-1, -1].

For example,
Given [5, 7, 7, 8, 8, 10] and target value 8,
return [3, 4].

题目翻译：

给定有序整数数组，找到给定目标值的起止位置。
算法的运行时间复杂度必须是O(log n)。
如果未在数组中找到目标值，返回[-1, -1]。
例如，
给定[5, 7, 7, 8, 8, 10]，目标值为8，
返回[3, 4]。

class Solution {
public:
    vector<int> searchRange(int A[], int n, int target) {
    	int left = 0;
    	int right = n - 1;

    	vector<int> result;
    	result.push_back(-1);
    	result.push_back(-1);

    	while(left <= right)
    	{
    		int mid = (left + right) / 2;

    		if(A[mid] > target)
    		{
    			right = mid - 1;
    		}
    		else if(A[mid] < target)
    		{
    			left = mid + 1;
    		}
    		else
    		{
    			result[0] = mid;
    			result[1] = mid;

    			int j = mid - 1;
    			while(j >= 0 && A[j] == target)
    			{
    				result[0] = j;
    				j--;
    			}

    			j = mid + 1;
    			while(j < n && A[j] == target)
    			{
    				result[1] = j;
    				j++;
    			}

    			break;
    		}
    	}

    	return result;
    }
};

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

		int[] result = { -1, -1 };

		while (left <= right) {
			int mid = (left + right) / 2;

			if (A[mid] > target) {
				right = mid - 1;
			} else if (A[mid] < target) {
				left = mid + 1;
			} else {
				result[0] = mid;
				result[1] = mid;

				int i = mid - 1;
				while (i >= 0 && A[i] == target) {
					result[0] = i;
					--i;
				}

				i = mid + 1;
				while (i < A.length && A[i] == target) {
					result[1] = i;
					++i;
				}

				break;
			}
		}

		return result;
    }
}

class Solution:
    # @param A, a list of integers
    # @param target, an integer to be searched
    # @return a list of length 2, [index1, index2]
    def searchRange(self, A, target):
        left = 0
        right = len(A) - 1
        
        result = [-1, -1]
        
        while left <= right:
            mid = (left + right) / 2
            
            if A[mid] > target:
                right = mid - 1
            elif A[mid] < target:
                left = mid + 1
            else:
                result[0] = mid
                result[1] = mid
                
                i = mid - 1
                while i >= 0 and A[i] == target:
                    result[0] = i
                    i -= 1
                
                i = mid + 1
                while i < len(A) and A[i] == target:
                    result[1] = i
                    i += 1
                    
                break
                
        return result