1. Two Sum

 

Easy

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].

class Solution {
    public int[] twoSum(int[] nums, int target) {
        int[] res = new int[2];
        //上下界问题
        /**
         * 首先两个索引肯定不能重复 j = i + 1;
         * 其次第一个索引最大为也是长度-1
         * 暴力求解
         */
        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 res;
    }

Java中的数组没怎么用，写的时候出现了一些懵逼的情况。这个算法非常一般，还能优化一下。但是，应该是我们一下子就会想出来的东西。