LeetCode 测试第一题

以后打算刷LeetCode的题先测试一下平台。

题目：

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, and you may not use the same element twice.

Example:

Given nums = [2, 7, 11, 15], target = 9,

Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].

java最简单的for循环嵌套：（只是想测试一下LeetCode）

public class Solution {
    public int[] twoSum(int[] nums, int target) {
        int[] result = 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){
                    result[0] = i;
                    result[1] = j;
                    
                }
            }
        }
        return result;
    }
}