LeetCode - 1. Two Sum

Java

class Solution {
    public int[] twoSum(int[] nums, int target) {
        int l = nums.length;
        int[] res = new int[2];
        int i,j;
        for (i = 0; i < l-1; i  ) {
            for (j=i 1;j<l;j  ) {
                if (nums[i]   nums[j] == target) {
                    res[0] = i;
                    res[1] = j;
                }
            }
        }
        return res;
    }
}

这篇好文章是转载于：学新通技术网