hacktoberfest/Java/twoSum.java at c831b5e381186ad0a5735b6bd4ba343e3efc8d10 · keshavsingh3197/hacktoberfest · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
package twosum;

import java.util.Scanner;

public class twoSum {

    public static void main(String[] args) {

        Scanner sc = new Scanner(System.in);

        // Get inputs
        System.out.println("Enter the size of the array:");
        int n = sc.nextInt();

        int[] arr = new int[n];
        System.out.println("Enter " + n + " integers:");
        for (int i = 0; i < n; i++) {
            arr[i] = sc.nextInt();
        }

        System.out.println("Enter the target sum:");
        int target = sc.nextInt();

        boolean found = false;

        // Find two numbers that add up to target
        for (int i = 0; i < n; i++) {
            for (int j = i + 1; j < n; j++) {
                if (arr[i] + arr[j] == target) {
                    System.out.println("Two numbers found at indices " + i + " and " + j);
                    System.out.println("Numbers are: " + arr[i] + " + " + arr[j] + " = " + target);
                    found = true;
                    break;
                }
            }
            if (found) break;
        }

        if (!found) {
            System.out.println("No two numbers found with the given target sum.");
        }
    }
}