LeetCode 167. Two Sum II - Input array is sorted

本文链接：https://blog.csdn.net/yanqinghe123/article/details/78735513

LeetCode 167. Two Sum II - Input array is sorted

问题来源LeetCode 167. Two Sum II - Input array is sorted

问题描述

Given an array of integers that is already sorted in ascending order, find two numbers such that they add up to a specific target number.

The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2. Please note that your returned answers (both index1 and index2) are not zero-based.

You may assume that each input would have exactly one solution and you may not use the same element twice.
Input: numbers={2, 7, 11, 15}, target=9
Output: index1=1, index2=2

问题分析

这道题是已经排序好的数组，那么使用贪心算法就可以了。维护两个游标，从数组的左边和右边进行选取，如果元素的和大于目标值，移动右边游标（-1），如果元素的和小于目标值，移动左边游标（+1），如果相等，直接返回。。

Java代码

public int majorityElement(int[] nums) {
    int major = nums[0],count = 1;
    for(int i =1;i < nums.length;i++){
        if(count == 0){
            major = nums[i];
            count++;
        }else if(major == nums[i]){
            count++;
        }else count--;
    }
    return major;
}