Leetcode：1. Two Sum

最新推荐文章于 2019-11-09 15:20:12 发布

哎呀妈呀脑壳疼脑壳疼

最新推荐文章于 2019-11-09 15:20:12 发布

阅读量165

点赞数

本文链接：https://blog.csdn.net/u013983628/article/details/86148831

版权

Leetcode：1. Two Sum

public class TwoSum1 {
    public static void main(String[] args) {
        int[] nums = new int[]{2, 7, 11, 15};
        int target = 9;
        int a[] = new int[2];
        a = twoSum(nums, target);
        System.out.println(a[0]+"----------"+a[1]);
    }
    
    public static int[] twoSum(int[] nums,int target){
        int[] a = 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){
                    a[0]=i;
                    a[1]=j;
                    
                    return a;
                }
            }
        }
        return a;
    }
}