LeetCode第一题

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/wlittlefive/article/details/80735778

描述：

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实现：

这是最笨的方法，要一点点优化

package com.wisdombud.zcwang.leetcode;

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

    public static void main(final String[] args) {

        final Solution solution = new Solution();
        final int[] result = solution.twoSum(new int[] {2, 7, 12, 23}, 9);
        for (int i = 0; i < result.length; i++) {
            System.out.print(result[i] + " ");
        }
    }
}