Commit89d08ee

committed

add 2012

1 parent3fbd919 commit89d08eeCopy full SHA for 89d08ee

File tree

+72

-0

lines changed

README.md
src
- main/java/com/fishercoder/solutions
  - _2012.java
- test/java/com/fishercoder
  - _2012Test.java

+72

-0

lines changed

Lines changed: 1 addition & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ ★`
`8`	`8`
`9`	`9`	`\| # \| Title \| Solutions \| Video \| Difficulty \| Tag`
`10`	`10`	`\|-----\|----------------\|---------------\|--------\|-------------\|-------------`
	`11`	`+\|2012\|[Sum of Beauty in the Array](https://leetcode.com/problems/sum-of-beauty-in-the-array/)\|[Java](../master/src/main/java/com/fishercoder/solutions/_2012.java)\|\|Medium\|\|`
`11`	`12`	`\|2011\|[Final Value of Variable After Performing Operations](https://leetcode.com/problems/final-value-of-variable-after-performing-operations/)\|[Java](../master/src/main/java/com/fishercoder/solutions/_2011.java)\|\|Easy\|\|`
`12`	`13`	`\|2007\|[Find Original Array From Doubled Array](https://leetcode.com/problems/find-original-array-from-doubled-array/)\|[Java](../master/src/main/java/com/fishercoder/solutions/_2007.java)\|\|Medium\|\|`
`13`	`14`	`\|2006\|[Count Number of Pairs With Absolute Difference K](https://leetcode.com/problems/count-number-of-pairs-with-absolute-difference-k/)\|[Java](../master/src/main/java/com/fishercoder/solutions/_2006.java)\|\|Easy\|\|`

Lines changed: 34 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,34 @@`
	`1`	`+packagecom.fishercoder.solutions;`
	`2`	`+`
	`3`	`+importjava.util.Arrays;`
	`4`	`+`
	`5`	`+publicclass_2012 {`
	`6`	`+publicstaticclassSolution1 {`
	`7`	`+publicintsumOfBeauties(int[]nums) {`
	`8`	`+int[]preMax =newint[nums.length];`
	`9`	`+preMax[0] =nums[0];`
	`10`	`+intmax =nums[0];`
	`11`	`+for (inti =1;i <nums.length;i++) {`
	`12`	`+max =Math.max(max,nums[i]);`
	`13`	`+preMax[i] =max;`
	`14`	`+ }`
	`15`	`+int[]postMin =newint[nums.length];`
	`16`	`+Arrays.fill(postMin,Integer.MAX_VALUE);`
	`17`	`+intmin =nums[nums.length -1];`
	`18`	`+postMin[nums.length -1] =nums[nums.length -1];`
	`19`	`+for (inti =nums.length -2;i >=0;i--) {`
	`20`	`+min =Math.min(min,nums[i]);`
	`21`	`+postMin[i] =min;`
	`22`	`+ }`
	`23`	`+intsum =0;`
	`24`	`+for (inti =1;i <=nums.length -2;i++) {`
	`25`	`+if (nums[i] >preMax[i -1] &&nums[i] <postMin[i +1]) {`
	`26`	`+sum +=2;`
	`27`	`+ }elseif (nums[i] >nums[i -1] &&nums[i] <nums[i +1]) {`
	`28`	`+sum++;`
	`29`	`+ }`
	`30`	`+ }`
	`31`	`+returnsum;`
	`32`	`+ }`
	`33`	`+ }`
	`34`	`+}`

Lines changed: 37 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,37 @@`
	`1`	`+packagecom.fishercoder;`
	`2`	`+`
	`3`	`+importcom.fishercoder.solutions._2012;`
	`4`	`+importorg.junit.BeforeClass;`
	`5`	`+importorg.junit.Test;`
	`6`	`+`
	`7`	`+importstaticorg.junit.Assert.assertEquals;`
	`8`	`+`
	`9`	`+publicclass_2012Test {`
	`10`	`+privatestatic_2012.Solution1solution1;`
	`11`	`+`
	`12`	`+@BeforeClass`
	`13`	`+publicstaticvoidsetup() {`
	`14`	`+solution1 =new_2012.Solution1();`
	`15`	`+ }`
	`16`	`+`
	`17`	`+@Test`
	`18`	`+publicvoidtest1() {`
	`19`	`+assertEquals(1,solution1.sumOfBeauties(newint[]{2,4,6,4}));`
	`20`	`+ }`
	`21`	`+`
	`22`	`+@Test`
	`23`	`+publicvoidtest2() {`
	`24`	`+assertEquals(14,solution1.sumOfBeauties(newint[]{1,2,3,4,5,7,8,9,10}));`
	`25`	`+ }`
	`26`	`+`
	`27`	`+@Test`
	`28`	`+publicvoidtest3() {`
	`29`	`+assertEquals(0,solution1.sumOfBeauties(newint[]{9,9,3,8,7,9,6,10}));`
	`30`	`+ }`
	`31`	`+`
	`32`	`+@Test`
	`33`	`+publicvoidtest4() {`
	`34`	`+assertEquals(0,solution1.sumOfBeauties(newint[]{8,4,6,3,10,5,8,5,5,9}));`
	`35`	`+ }`
	`36`	`+`
	`37`	`+}`

Comments

(0)