offer-57

输入一个递增排序的数组和一个数字s，在数组中查找两个数，使得它们的和正好是s。如果有多对数字的和等于s，则输出任意一对即可。

示例 1：

输入：nums = [2,7,11,15], target = 9
输出：[2,7] 或者 [7,2]

示例 2：

输入：nums = [10,26,30,31,47,60], target = 40
输出：[10,30] 或者 [30,10]

限制：

• 1 <= nums.length <= 10^5
• 1 <= nums[i] <= 10^6

//leetcode submit region begin(Prohibit modification and deletion)
class Solution {
    public int[] twoSum(int[] nums, int target) {
        if (null == nums) {
            return null;
        }

        int start = 0, end = nums.length - 1;
        int[] result = null;

        while (start <= end) {
            if (nums[start] + nums[end] == target) {
                result = new int[2];
                result[0] = nums[start];
                result[1] = nums[end];
                break;
            } else if (nums[start] + nums[end] < target) {
                start++;
            } else {
                end--;
            }
        }

        return result;
    }
}
//leetcode submit region end(Prohibit modification and deletion)