Home/Questions/Q 4325
Next
In Process
abhinaw_9754
  • 1
Asked: 2021-11-14T20:13:13+05:30 In:

Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.

  • 1
Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.

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

Input: nums = [2,7,11,15], target = 9

Output: [0,1]

Output: Because nums[0] + nums[1] == 9, we return [0, 1].

Constraints:

2 <= nums.length <= 104

-109 <= nums[i] <= 109

-109 <= target <= 109

Only one valid answer exists.

given an array of integers nums and an integer targetreturn indices of the two numbers such that they add up to target.two sum problem
Share

    2 Answers

    2. 
//YOU CAN ALSO USE FOLLOWING CODE:

import java.util.HashMap;
import java.util.Scanner;
import java.util.Map;

class TwoSum {
    // Time complexity: O(n)
        private static int[] findTwoSum(int[] nums, int target) {
                Map numMap = new HashMap();
                        for (int i = 0; i < nums.length; i++) {
                                    int complement = target - nums[i];
                                                if (numMap.containsKey(complement)) {
                                                                return new int[] { numMap.get(complement), i };
                                                                            } else {
                                                                                            numMap.put(nums[i], i);
                                                                                                        }
                                                                                                                }
                                                                                                                        return new int[] {};
                                                                                                                            }
                                                                                                                            }
      • 2
    3. 

import java.util.HashMap;
import java.util.Scanner;
import java.util.Map;

class TwoSum {

    
        private static int[] findTwoSum_BruteForce(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[] {};
                                                                                                                }

    public static void main(String[] args) {
            Scanner keyboard = new Scanner(System.in);
        int n = keyboard.nextInt();
                int[] nums = new int[n];
        for(int i = 0; i < n; i++) {
                    nums[i] = keyboard.nextInt();
                            }
                                    int target = keyboard.nextInt();
        keyboard.close();
        int[] indices = findTwoSum_BruteForce(nums, target);
        if (indices.length == 2) {
                    System.out.println(indices[0] + " " + indices[1]);
                            } else {
                                        System.out.println("No solution found!");
                                                }
                                                    }
                                                    }
      • 0

    Leave an answer

    You must login to add an answer.

    Need An Account,