Update Longest Harmonious Subsequence.java

varunu28 · web-flow · commit 70600a3f2a11 · 2022-09-06T10:53:15.000-07:00
diff --git a/Easy/Longest Harmonious Subsequence.java b/Easy/Longest Harmonious Subsequence.java
@@ -1,13 +1,16 @@
 class Solution {
   public int findLHS(int[] nums) {
-    Map<Integer, Long> map = Arrays.stream(nums).boxed()
-        .collect(Collectors.groupingBy(Function.identity(), HashMap::new, Collectors.counting()));
-    int result = 0;
-    for (Integer key : map.keySet()) {
-      if (map.containsKey(key + 1)) {
-        result = Math.max(result, (int) (map.get(key) + map.get(key + 1)));
+    int maxSubarraySize = 0;
+    Map<Integer, Integer> map = new HashMap<>();
+    for (int num : nums) {
+      map.put(num, map.getOrDefault(num, 0) + 1);
+      if (map.containsKey(num + 1)) {
+        maxSubarraySize = Math.max(maxSubarraySize, map.get(num) + map.get(num + 1));
+      }
+      if (map.containsKey(num - 1)) {
+        maxSubarraySize = Math.max(maxSubarraySize, map.get(num) + map.get(num - 1));
       }
     }
-    return result;
+    return maxSubarraySize;
   }
 }

Original file line number	Diff line number	Diff line change
`@@ -1,13 +1,16 @@`
`1`	`1`	`class Solution {`
`2`	`2`	`public int findLHS(int[] nums) {`
`3`		`- Map<Integer, Long> map = Arrays.stream(nums).boxed()`
`4`		`- .collect(Collectors.groupingBy(Function.identity(), HashMap::new, Collectors.counting()));`
`5`		`- int result = 0;`
`6`		`- for (Integer key : map.keySet()) {`
`7`		`- if (map.containsKey(key + 1)) {`
`8`		`- result = Math.max(result, (int) (map.get(key) + map.get(key + 1)));`
	`3`	`+ int maxSubarraySize = 0;`
	`4`	`+ Map<Integer, Integer> map = new HashMap<>();`
	`5`	`+ for (int num : nums) {`
	`6`	`+ map.put(num, map.getOrDefault(num, 0) + 1);`
	`7`	`+ if (map.containsKey(num + 1)) {`
	`8`	`+ maxSubarraySize = Math.max(maxSubarraySize, map.get(num) + map.get(num + 1));`
	`9`	`+ }`
	`10`	`+ if (map.containsKey(num - 1)) {`
	`11`	`+ maxSubarraySize = Math.max(maxSubarraySize, map.get(num) + map.get(num - 1));`
`9`	`12`	`}`
`10`	`13`	`}`
`11`		`- return result;`
	`14`	`+ return maxSubarraySize;`
`12`	`15`	`}`
`13`	`16`	`}`