剑指 Offer 57. 和为s的两个数字

class Solution {
    public int[] twoSum(int[] nums, int target) {
        int i = 0;
        int j = nums.length - 1;
        while(i < j){
            int s = nums[i] + nums[j];
            if(s < target) i++;
            else if (s > target) j--;
            else return new int[]{nums[i],nums[j]};
        }
        return new int[0];
    }
}