1 two sum 532091433e064c7c9b7bbaec7a97d93f.md

1. two sum

Two Sum - LeetCode

package com.mycompany.firstproject;

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

import static java.lang.Math.*;

public class FirstProject {

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

            int sum = 0;

        for (int i = 0; i < nums.length ; i++) {
            sum = target - nums[i];

            for (int j = i+1; j < nums.length ; j++) {

                if (sum == nums[j]) {
                    return new int[]{i, j};
                }
            }

        }

        return new int[] {0,0};
    }
    public static void main(String[] args) {

        int arr[] = {3,8,2,4};

           int a[] =  twoSum(arr , 6);

           for (int z:a){
               System.out.println(z);
           }
    }
}