Commit7783f3f

committed

all solutions of Intersection of Two Arrays

1 parent172be00 commit7783f3fCopy full SHA for 7783f3f

File tree

+22

-1

lines changed

+22

-1

lines changed

Lines changed: 22 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -22,7 +22,28 @@ public class IntersectionOfTwoArrays {`
`22`	`22`	`//then I clicked its Tags, and find it's marked with so many tags: Binary Search, HashTable, Two Pointers, Sort, now I'll try to do it one by one`
`23`	`23`	`//inspired by this post: https://discuss.leetcode.com/topic/45685/three-java-solutions`
`24`	`24`	`publicint[]intersection_two_pointers(int[]nums1,int[]nums2) {`
`25`		`-`
	`25`	`+Set<Integer>set =newHashSet();`
	`26`	`+Arrays.sort(nums1);`
	`27`	`+Arrays.sort(nums2);`
	`28`	`+inti =0,j =0;`
	`29`	`+for(;i <nums1.length &&j <nums2.length;){`
	`30`	`+if(nums1[i] <nums2[j]){`
	`31`	`+i++;`
	`32`	`+ }elseif(nums1[i] >nums2[j]){`
	`33`	`+j++;`
	`34`	`+ }else {`
	`35`	`+set.add(nums1[i]);`
	`36`	`+i++;`
	`37`	`+j++;`
	`38`	`+ }`
	`39`	`+}`
	`40`	`+int[]result =newint[set.size()];`
	`41`	`+Iterator<Integer>it =set.iterator();`
	`42`	`+intk =0;`
	`43`	`+while(it.hasNext()){`
	`44`	`+result[k++] =it.next();`
	`45`	`+}`
	`46`	`+returnresult;`
`26`	`47`	`}`
`27`	`48`
`28`	`49`	`publicint[]intersection_binary_search(int[]nums1,int[]nums2) {`

Comments

(0)