Commit 5ec93df

committed

Added code for Finding Sum in array

1 parent 6bc2961 commit 5ec93dfCopy full SHA for 5ec93df

File tree

+30

-1

lines changed

+30

-1

lines changed

Lines changed: 30 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,30 @@`
	`1`	`+package arrays;`
	`2`	`+`
	`3`	`+import java.util.HashSet;`
	`4`	`+`
	`5`	`+//Given an array of integers and a value, determine if`
	`6`	`+//there are any two integers in the array which sum equal to the given value.`
	`7`	`+`
	`8`	`+public class ArraySumExists{`
	`9`	`+ public static void main(String args[]){`
	`10`	`+ int a[] = {5,7,1,2,4,3,8};`
	`11`	`+ int k = 6;`
	`12`	`+`
	`13`	`+ System.out.println(sum_exists(a,k));`
	`14`	`+ }`
	`15`	`+`
	`16`	`+ private static String sum_exists(int[] a, int k) {`
	`17`	`+`
	`18`	`+ HashSet<Integer> values = new HashSet<>();`
	`19`	`+`
	`20`	`+ for(int i = 0; i < a.length; i++){`
	`21`	`+ if (values.contains(k-a[i])){`
	`22`	`+ return "Sum exists : ("+a[i]+","+(k-a[i])+")";`
	`23`	`+ } else{`
	`24`	`+ values.add(a[i]);`
	`25`	`+ }`
	`26`	`+ }`
	`27`	`+`
	`28`	`+ return "Sum not found";`
	`29`	`+ }`
	`30`	`+}`

Lines changed: 0 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -13,7 +13,6 @@ public static void main(String args[]){`
`13`	`13`	`ArrayList<Tuple<Integer,Integer>> test = new ArrayList<Tuple<Integer,Integer>>();`
`14`	`14`
`15`	`15`
`16`		`-`
`17`	`16`	`}`
`18`	`17`
`19`	`18`	`public class Pair<F,S>{`

Comments

(0)