首页 > itarticle > leetcode 1: two sum

leetcode 1: two sum

admin 11月 11, 2020 0

题目:

Given an array of integers, return indices of the two numbers such that they add up to a specific target.
You may assume that each input would have exactly one solution.

Example:
Given nums = [2, 7, 11, 15], target = 9,
Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].

UPDATE (2016/2/13):The return format had been changed to zero-based indices. Please read the above updated description carefully.

代码：

    public int[] twoSum(int[] nums, int target) {
        if(nums == null || nums.length == 0){
            return null;
        }
        for(int i = 0;i < nums.length;i++){
            int cur = target-nums[i];
            for(int j = i+1;j < nums.length;j++){
            if(cur == nums[j]){
                int[] result = new int[2];
                result[0] = i;
                result[1] = j;
                return result;
            }
         }   
        }
        return null;
    }
}