Leetcode167. 两数之和 II - 输入有序数组——双指针法/二分查找法

双指针法

class Solution {
public:
    vector<int> twoSum(vector<int>& numbers, int target) {
        int left = 0;
        int right = numbers.size() - 1;
        int sum;

        while(left < right){
            sum = numbers[left] + numbers[right];
            if(sum < target){
                left ++;
            }else if(sum > target){
                right --;
            }else{
                break;
            }
        }

        return {left + 1, right + 1};
    }
};

二分法

看到有序数组应该想到二分法。
粗略版本

class Solution {
public:
    vector<int> twoSum(vector<int>& numbers, int target) {
        int i, j;
        int flag = 0;
        for(i = 0; i < numbers.size(); i++){
            int n = target - numbers[i];
            int left = i + 1;
            int right = numbers.size() - 1;
            while(left <= right){
                int mid = left + (right - left) / 2;
                if(numbers[mid] > n){
                    right = mid - 1;
                }else if(numbers[mid] < n){
                    left = mid + 1;
                }else {
                    j = mid;
                    flag = 1;
                    break;
                }
            }
            if(flag == 1) break;
        }
        return {i + 1, j + 1};
    }
};

二分法的效率还挺高的。

稍微改进一下，直接在循环内部返回。

class Solution {
public:
    vector<int> twoSum(vector<int>& numbers, int target) {
        for(int i = 0; i < numbers.size(); i++){
            int n = target - numbers[i];
            int left = i + 1;
            int right = numbers.size() - 1;
            while(left <= right){
                int mid = left + (right - left) / 2;
                if(numbers[mid] > n){
                    right = mid - 1;
                }else if(numbers[mid] < n){
                    left = mid + 1;
                }else {
                    return {i + 1, mid + 1};
                }
            }
        }
        return {};
    }
};

也可以将二分法封装到函数里

class Solution {
public:
    int binarySearch(vector<int>& numbers, int target, int j){
        int left = j;
        int right = numbers.size() - 1;

        while(left <= right){
            int mid = left + (right - left) / 2;
            if(numbers[mid] == target) {
                return mid;
            }else if(numbers[mid] > target){
                right = mid - 1;
            }else{
                left = mid + 1;
            }
        }
        return -1;
    }
    
    vector<int> twoSum(vector<int>& numbers, int target) {
        for(int i = 0; i < numbers.size(); i++){
            int n = target - numbers[i];
            int j = binarySearch(numbers, n, i + 1);
            if(j != -1) return {i + 1, j + 1};
        }
        return {};
    }
};

通过本题学习到的小语法点：

• 返回值为vertor类型时，return {} 即可。
• 跳出两层循环嵌套，可以设立一个flag。