Commit 5c77ee7

committed

solution S349 S455

1 parent b415c8c commit 5c77ee7Copy full SHA for 5c77ee7

File tree

+66

-0

lines changed

+66

-0

lines changed

Lines changed: 31 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,31 @@`
	`1`	`+import java.util.*;`
	`2`	`+`
	`3`	`+/**`
	`4`	`+ * LC#349:两个数组的交集`
	`5`	`+ * Link:https://leetcode-cn.com/problems/intersection-of-two-arrays/`
	`6`	`+ * Solution:熟悉一下 Java 集合的用法。。。`
	`7`	`+ */`
	`8`	`+public class S349 {`
	`9`	`+`
	`10`	`+ public int[] intersection(int[] nums1, int[] nums2) {`
	`11`	`+ Set<Integer> set1 = new HashSet<>(),set2 = new HashSet<>();`
	`12`	`+ List<Integer> list = new ArrayList<>();`
	`13`	`+ for(int i:nums1){`
	`14`	`+ list.add(i);`
	`15`	`+ }`
	`16`	`+ for(int i:nums2){`
	`17`	`+ set2.add(i);`
	`18`	`+ }`
	`19`	`+ list.retainAll(set2);`
	`20`	`+ set1.addAll(list);`
	`21`	`+ return set1.stream().mapToInt(i->i).toArray();`
	`22`	`+ }`
	`23`	`+`
	`24`	`+ public static void main(String[] args) {`
	`25`	`+ int[] nums1 = {1, 2, 2, 1};`
	`26`	`+ int[] nums2 = {2, 2};`
	`27`	`+`
	`28`	`+ int[] intersection = new S349().intersection(nums1, nums2);`
	`29`	`+ System.out.println(intersection);`
	`30`	`+ }`
	`31`	`+}`

Lines changed: 35 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,35 @@`
	`1`	`+import java.util.Arrays;`
	`2`	`+`
	`3`	`+/**`
	`4`	`+ * LC#455:Assign Cookies 分发饼干`
	`5`	`+ * Link:https://leetcode-cn.com/problems/assign-cookies/`
	`6`	`+ * Solution1:排序数组后,进行对比即可得到想要的孩子的数量`
	`7`	`+ * @author Phoenix on 2021年7月11日.`
	`8`	`+ */`
	`9`	`+public class S455 {`
	`10`	`+`
	`11`	`+ public int findContentChildren(int[] g, int[] s) {`
	`12`	`+ // sort for compare array`
	`13`	`+ Arrays.sort(g);`
	`14`	`+ Arrays.sort(s);`
	`15`	`+ int cookies = 0, children = 0;`
	`16`	`+ while (children < g.length && cookies < s.length) {`
	`17`	`+ // if cookies are greater than expected, children are incr`
	`18`	`+ if (g[children] <= s[cookies]) {`
	`19`	`+ children++;`
	`20`	`+ }`
	`21`	`+ //Cookies can only be used once`
	`22`	`+ cookies++;`
	`23`	`+ }`
	`24`	`+ return children;`
	`25`	`+ }`
	`26`	`+`
	`27`	`+ public static void main(String[] args) {`
	`28`	`+ int[] g = {1, 2, 3};`
	`29`	`+ int[] s = {1, 1};`
	`30`	`+`
	`31`	`+ int result = new S455().findContentChildren(g, s);`
	`32`	`+ System.out.println("result: " + result);`
	`33`	`+ }`
	`34`	`+`
	`35`	`+}`

Comments

(0)