add 1051

Author: fishercoder1534

README.md

@@ -27,6 +27,7 @@ Your ideas/fixes/algorithms are more than welcome!
 
 |  #  |      Title     |   Solutions   | Time          | Space         | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|---------------|---------------|--------|-------------|-------------
+|1051|[Height Checker](https://leetcode.com/problems/height-checker/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1051.java) | O(nlogn) | O(1) | |Easy||
 |1047|[Remove All Adjacent Duplicates In String](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1047.java) | O(n) | O(1) | |Easy||
 |1037|[Valid Boomerang](https://leetcode.com/problems/valid-boomerang/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1037.java) | O(1) | O(1) | |Easy|Math|
 |1033|[Moving Stones Until Consecutive](https://leetcode.com/problems/moving-stones-until-consecutive/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1033.java) | O(1) | O(1) | |Easy|Math|

src/main/java/com/fishercoder/solutions/_1051.java

@@ -0,0 +1,37 @@
+package com.fishercoder.solutions;
+
+import java.util.Arrays;
+
+/**
+ * 1051. Height Checker
+ *
+ * Students are asked to stand in non-decreasing order of heights for an annual photo.
+ * Return the minimum number of students not standing in the right positions.
+ * (This is the number of students that must move in order for all students to be standing in non-decreasing order of height.)
+ *
+ * Example 1:
+ * Input: [1,1,4,2,1,3]
+ * Output: 3
+ * Explanation:
+ * Students with heights 4, 3 and the last 1 are not standing in the right positions.
+ *
+ * Note:
+ *
+ * 1 <= heights.length <= 100
+ * 1 <= heights[i] <= 100
+ * */
+public class _1051 {
+    public static class Solution1 {
+        public int heightChecker(int[] heights) {
+            int[] originals = Arrays.copyOf(heights, heights.length);
+            Arrays.sort(heights);
+            int count = 0;
+            for (int i = 0; i < originals.length; i++) {
+                if (heights[i] != originals[i]) {
+                    count++;
+                }
+            }
+            return count;
+        }
+    }
+}

src/test/java/com/fishercoder/_1051Test.java

@@ -0,0 +1,22 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1051;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _1051Test {
+    private static _1051.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1051.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(3, solution1.heightChecker(new int[]{1, 1, 4, 2, 1, 3}));
+    }
+
+}