1|Two Sum

Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.
You may assume that each input would have exactly one solution, and you may not use the same element twice.
You can return the answer in any order.

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

Example 2:
Input: nums = [3,2,4], target = 6
Output: [1,2]
Example 3:

Input: nums = [3,3], target = 6
Output: [0,1]

Constraints:
2 <= nums.length <= 105
-109 <= nums[i] <= 109
-109 <= target <= 109
Only one valid answer exists.

暴力求解

class Solution {
    public int[] twoSum(int[] nums, int target) {

            for (int i=0;i<nums.length;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];
     
    }
}

package com.company;

import java.util.Arrays;
import java.util.Scanner;

public class TwoSum1 {

        public static int[] twoSum(int[] nums, int target) {

            for (int i=0;i<nums.length;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(String[] args) {

        Scanner x = new Scanner(System.in);
       int n;
       n=x.nextInt();
       int []nums=new int[n];
               for (int i=0;i<n;i++){
                   nums[i]=x.nextInt();
               }
               int target;
               target=x.nextInt();
        String intArrayString = Arrays.toString(twoSum(nums,target));
        System.out.println(intArrayString);

        }
}