From b1368cf86de86c86d726801fe82b87019995ca30 Mon Sep 17 00:00:00 2001 From: mpeters Date: Fri, 11 Oct 2019 12:32:57 -0400 Subject: [PATCH 1/3] #442 solution --- #442/Solution.java | 17 +++++++++++++++++ 1 file changed, 17 insertions(+) create mode 100644 #442/Solution.java diff --git a/#442/Solution.java b/#442/Solution.java new file mode 100644 index 0000000..d8de9ef --- /dev/null +++ b/#442/Solution.java @@ -0,0 +1,17 @@ +/** + * https://leetcode.com/problems/find-all-duplicates-in-an-array/ + */ + +class Solution { + public List findDuplicates(int[] nums) { + List duplicates = new ArrayList(); + Set noDupes = new HashSet(); + for (int i = 0; i < nums.length; i++){ + boolean isAdded = noDupes.add(nums[i]); + if(isAdded == false) { + duplicates.add(nums[i]); + } + } + return duplicates; + } +} From 06a2de32892375f72defd291b02003dcb42fab03 Mon Sep 17 00:00:00 2001 From: mpeters Date: Fri, 11 Oct 2019 12:37:12 -0400 Subject: [PATCH 2/3] #442 solution --- #442/Solution.java | 3 +-- 1 file changed, 1 insertion(+), 2 deletions(-) diff --git a/#442/Solution.java b/#442/Solution.java index d8de9ef..67bade0 100644 --- a/#442/Solution.java +++ b/#442/Solution.java @@ -7,8 +7,7 @@ public List findDuplicates(int[] nums) { List duplicates = new ArrayList(); Set noDupes = new HashSet(); for (int i = 0; i < nums.length; i++){ - boolean isAdded = noDupes.add(nums[i]); - if(isAdded == false) { + if(noDupes.add(nums[i]) == false) { duplicates.add(nums[i]); } } From 3ca1fbf31cd1abd1f52e2e203a1b36b4ba0b583a Mon Sep 17 00:00:00 2001 From: mpeters Date: Fri, 11 Oct 2019 13:36:58 -0400 Subject: [PATCH 3/3] #70 solution --- #70/Solution.java | 15 +++++++++++++++ 1 file changed, 15 insertions(+) create mode 100644 #70/Solution.java diff --git a/#70/Solution.java b/#70/Solution.java new file mode 100644 index 0000000..6afdefb --- /dev/null +++ b/#70/Solution.java @@ -0,0 +1,15 @@ +class Solution { + public int climbStairs(int n) { + if(n ==1) { + return n; + } + int first = 1; + int second = 2; + for (int i = 3; i <= n; i++) { + int third = first + second; + first = second; + second = third; + } + return second; + } +} \ No newline at end of file