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.

Input: numbers={2, 7, 11, 15}, target=9
Output: index1=1, index2=2

public class Solution {
    public  int[] twoSum(int[] numbers, int target) {
    	int[] res=new int[2];
    	
    	
    	for(int i=0;i<numbers.length;i++)
    	{
    		if(i==0)
    		{
    			for(int j=i+1;j<numbers.length;j++)
    			{
    				if(numbers[i]+numbers[j]==target)
    				{
    					res[0]=i+1;
    					res[1]=j+1;
    				}
    				
    			}
    		}
    		else if(numbers[i]<=target/2&&numbers[i]!=numbers[i-1])
    		{
    		
    		for(int j=i+1;j<numbers.length;j++)
    			{
    				if(numbers[i]+numbers[j]==target)
    				{
    					res[0]=i+1;
    					res[1]=j+1;
    				}
    				
    			}
    		}
    		
    		
    	}
    	return res;
        
    }
}

如果不做处理的话会超时，因为数组是升序排列的，所以我们遍历第一个数的时候只用遍历到小于等于target值一半的地方，而且为了避免重复的数重新计算，比如前面有一千个零，如果第一个零失败的话那后面的999个零自然是失败的，所以此时无须做这999次循环计算，直接跳到下一个值不同的数，其实还可以继续优化，就是当nums［i］＋ nums［j］已经开始大于target值时，后面的值就可以不考虑了。