2.15 LeetCode两数之和

class Solution {
    public int[] twoSum(int[] nums, int target) {
        if(nums.length < 2){
            return new int[0];
        }
        int[] rearr = new int[2];
        //查询元素
        for(int i = 0; i < nums.length; i++){
            for(int j = i+1; j < nums.length; j++ ){
                //发现符合条件情况
                if(nums[i] + nums[j] ==target){
                    rearr[0] = i;
                    rearr[1] = j;
                }
            }
        }
        return rearr;
    }
}

class  tt1
{
	public static void main(String[] args) 
	{
		int[] arr = {1,2,4,7};
		int target = 9;
		int[] rearr = new int[2];
		rearr = twoSum(arr, target);
		System.out.print("[");
		for(int i=0;i<rearr.length;i++)
		{
			if(i!=rearr.length-1)
				System.out.print(rearr[i]+",");
			else
				System.out.print(rearr[i]+"]");
		}
	}
	public static int[] twoSum(int[] nums, int target) {
        if(nums.length < 2){
            return new int[0];
        }
        int[] rearr = new int[2];
        //查询元素
        for(int i = 0; i < nums.length; i++){
            for(int j = i+1; j < nums.length; j++ ){
                //发现符合条件情况
                if(nums[i] + nums[j] ==target){
                    rearr[0] = i;
                    rearr[1] = j;
                }
            }
        }
        return rearr;
    }

}