GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — Java/Programs/Two_Sum.java at main · am-opensource-learner-void/Java Expand file tree/ Copy pathTwo_Sum.javaMore file actions 47 lines (45 loc) · 1.41 KB / Copy pathTwo_Sum.javaFile metadata and controls47 lines (45 loc) · 1.41 KB 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 44 45 46 47 //In this code a array is taken along with an target element. The sum of two elements matching with the target element is displayed import java.util.*; public class Two_Sum { public static void main(String args[]) { try (Scanner sc = new Scanner(System.in)) { int n = sc.nextInt(); // length of the array is taken int a[] = new int[n]; for(int i = 0; i < n; i++) { a[i] = sc.nextInt(); } int target=sc.nextInt(); // target value is initialzized int array[] = new int[2]; a=twoSum(array,target); // method is called for(int i=0;i<2;i++) { System.out.print(a[i]+" "); } System.out.println(); } } public static int[] twoSum(int[] n, int target) { Map<Integer,Integer> nm=new HashMap<>(); // hashmap is created to store the array elements int array[]=new int[2]; int k=n.length; for(int i=0;i<k;i++) { if(nm.containsKey(target-n[i])) { array[0]=nm.get(target-n[i]); array[1]=i; break; // The sum of the elements equals to the target is storee } nm.put(n[i],i); } return array; // the answer array is returned } } |
| You are visitor 01402503 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |