Commit 0f458de

authored

新增java解法(hashArray)

1 parent 8dc66e3 commit 0f458deCopy full SHA for 0f458de

File tree

+23

-2

lines changed

+23

-2

lines changed

Lines changed: 23 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -121,7 +121,7 @@ public:`
`121`	`121`	`## 其他语言版本`
`122`	`122`
`123`	`123`	`### Java:`
`124`		`-`
	`124`	`+版本一:使用HashSet`
`125`	`125`	```Java
`126`	`126`	`import java.util.HashSet;`
`127`	`127`	`import java.util.Set;`
`@@ -159,7 +159,28 @@ class Solution {`
`159`	`159`	`}`
`160`	`160`	`}`
`161`	`161`	```
`162`		`-`
	`162`	`+版本二:使用Hash數組`
	`163`	+```java
	`164`	`+class Solution {`
	`165`	`+ public int[] intersection(int[] nums1, int[] nums2) {`
	`166`	`+ int[] hash1 = new int[1002];`
	`167`	`+ int[] hash2 = new int[1002];`
	`168`	`+ for(int i : nums1)`
	`169`	`+ hash1[i]++;`
	`170`	`+ for(int i : nums2)`
	`171`	`+ hash2[i]++;`
	`172`	`+ List<Integer> resList = new ArrayList<>();`
	`173`	`+ for(int i = 0; i < 1002; i++)`
	`174`	`+ if(hash1[i] > 0 && hash2[i] > 0)`
	`175`	`+ resList.add(i);`
	`176`	`+ int index = 0;`
	`177`	`+ int res[] = new int[resList.size()];`
	`178`	`+ for(int i : resList)`
	`179`	`+ res[index++] = i;`
	`180`	`+ return res;`
	`181`	`+ }`
	`182`	`+}`
	`183`	+```
`163`	`184`	`### Python3:`
`164`	`185`	`(版本一) 使用字典和集合`
`165`	`186`

Comments

(0)