add 2012

fishercoder1534 · fishercoder1534 · commit 89d08ee35c57 · 2021-09-19T07:30:55.000-07:00
diff --git a/README.md b/README.md
@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ &#9733;
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                  
 |-----|----------------|---------------|--------|-------------|-------------
+|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||
 |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||
 |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||
 |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||
diff --git a/src/main/java/com/fishercoder/solutions/_2012.java b/src/main/java/com/fishercoder/solutions/_2012.java
@@ -0,0 +1,34 @@
+package com.fishercoder.solutions;
+
+import java.util.Arrays;
+
+public class _2012 {
+    public static class Solution1 {
+        public int sumOfBeauties(int[] nums) {
+            int[] preMax = new int[nums.length];
+            preMax[0] = nums[0];
+            int max = nums[0];
+            for (int i = 1; i < nums.length; i++) {
+                max = Math.max(max, nums[i]);
+                preMax[i] = max;
+            }
+            int[] postMin = new int[nums.length];
+            Arrays.fill(postMin, Integer.MAX_VALUE);
+            int min = nums[nums.length - 1];
+            postMin[nums.length - 1] = nums[nums.length - 1];
+            for (int i = nums.length - 2; i >= 0; i--) {
+                min = Math.min(min, nums[i]);
+                postMin[i] = min;
+            }
+            int sum = 0;
+            for (int i = 1; i <= nums.length - 2; i++) {
+                if (nums[i] > preMax[i - 1] && nums[i] < postMin[i + 1]) {
+                    sum += 2;
+                } else if (nums[i] > nums[i - 1] && nums[i] < nums[i + 1]) {
+                    sum++;
+                }
+            }
+            return sum;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_2012Test.java b/src/test/java/com/fishercoder/_2012Test.java
@@ -0,0 +1,37 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._2012;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _2012Test {
+    private static _2012.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _2012.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(1, solution1.sumOfBeauties(new int[]{2, 4, 6, 4}));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals(14, solution1.sumOfBeauties(new int[]{1, 2, 3, 4, 5, 7, 8, 9, 10}));
+    }
+
+    @Test
+    public void test3() {
+        assertEquals(0, solution1.sumOfBeauties(new int[]{9, 9, 3, 8, 7, 9, 6, 10}));
+    }
+
+    @Test
+    public void test4() {
+        assertEquals(0, solution1.sumOfBeauties(new int[]{8, 4, 6, 3, 10, 5, 8, 5, 5, 9}));
+    }
+
+}
