Commit263e0d8

committed

add a solution for 1695

1 parent9f46e09 commit263e0d8Copy full SHA for 263e0d8

File tree

+56

-0

lines changed

src
- main/java/com/fishercoder/solutions
  - _1695.java
- test/java/com/fishercoder
  - _1695Test.java

+56

-0

lines changed

Lines changed: 27 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,6 +1,8 @@`
`1`	`1`	`packagecom.fishercoder.solutions;`
`2`	`2`
	`3`	`+importjava.util.HashMap;`
`3`	`4`	`importjava.util.HashSet;`
	`5`	`+importjava.util.Map;`
`4`	`6`	`importjava.util.Set;`
`5`	`7`
`6`	`8`	`publicclass_1695 {`
`@@ -26,4 +28,29 @@ public int maximumUniqueSubarray(int[] nums) {`
`26`	`28`	`returnmaxSum;`
`27`	`29`	`}`
`28`	`30`	`}`
	`31`	`+`
	`32`	`+publicstaticclassSolution2 {`
	`33`	`+/**`
	`34`	`+ * My completely original solution on 10/202/2021. Classic sliding window solution.`
	`35`	`+ */`
	`36`	`+publicintmaximumUniqueSubarray(int[]nums) {`
	`37`	`+Map<Integer,Integer>map =newHashMap<>();`
	`38`	`+intsum =0;`
	`39`	`+intstart =0;`
	`40`	`+intans =0;`
	`41`	`+for (inti =0;i <nums.length;i++) {`
	`42`	`+if (map.containsKey(nums[i])) {`
	`43`	`+IntegerlastIndex =map.get(nums[i]);`
	`44`	`+while (start <=lastIndex) {`
	`45`	`+sum -=nums[start];`
	`46`	`+start++;`
	`47`	`+ }`
	`48`	`+ }`
	`49`	`+sum +=nums[i];`
	`50`	`+map.put(nums[i],i);`
	`51`	`+ans =Math.max(ans,sum);`
	`52`	`+ }`
	`53`	`+returnans;`
	`54`	`+ }`
	`55`	`+ }`
`29`	`56`	`}`

Lines changed: 29 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,29 @@`
	`1`	`+packagecom.fishercoder;`
	`2`	`+`
	`3`	`+importcom.fishercoder.solutions._1695;`
	`4`	`+importorg.junit.BeforeClass;`
	`5`	`+importorg.junit.Test;`
	`6`	`+`
	`7`	`+importstaticorg.junit.Assert.assertEquals;`
	`8`	`+`
	`9`	`+publicclass_1695Test {`
	`10`	`+privatestatic_1695.Solution1solution1;`
	`11`	`+privatestatic_1695.Solution2solution2;`
	`12`	`+privatestaticint[]nums;`
	`13`	`+privatestaticintexpected;`
	`14`	`+`
	`15`	`+@BeforeClass`
	`16`	`+publicstaticvoidsetup() {`
	`17`	`+solution1 =new_1695.Solution1();`
	`18`	`+solution2 =new_1695.Solution2();`
	`19`	`+ }`
	`20`	`+`
	`21`	`+@Test`
	`22`	`+publicvoidtest1() {`
	`23`	`+nums =newint[]{4,2,4,5,6};`
	`24`	`+expected =17;`
	`25`	`+assertEquals(expected,solution1.maximumUniqueSubarray(nums));`
	`26`	`+assertEquals(expected,solution2.maximumUniqueSubarray(nums));`
	`27`	`+ }`
	`28`	`+`
	`29`	`+}`

Comments

(0)