feat: add solutions to lc problem: No.1051.Height Checker

Author: yanglbme

lcof2/剑指 Offer II 118. 多余的边/README.md

@@ -122,7 +122,7 @@ d[find(a)] = distance
 ```python
 class Solution:
     def findRedundantConnection(self, edges: List[List[int]]) -> List[int]:
-        p = [i for i in range(1010)]
+        p = list(range(1010))
 
         def find(x):
             if p[x] != x:

lcof2/剑指 Offer II 118. 多余的边/Solution.py

@@ -1,6 +1,6 @@
 class Solution:
     def findRedundantConnection(self, edges: List[List[int]]) -> List[int]:
-        p = [i for i in range(1010)]
+        p = list(range(1010))
 
         def find(x):
             if p[x] != x:

solution/1000-1099/1051.Height Checker/README.md

@@ -49,7 +49,6 @@
 	<li><code>1 <= heights[i] <= 100</code></li>
 </ul>
 
-
 ## 解法
 
 <!-- 这里可写通用的实现逻辑 -->
@@ -61,15 +60,81 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
+class Solution:
+    def heightChecker(self, heights: List[int]) -> int:
+        bucket = [0] * 101
+        for h in heights:
+            bucket[h] += 1
+        res = i = 0
+        for j in range(1, 101):
+            while bucket[j] > 0:
+                bucket[j] -= 1
+                if heights[i] != j:
+                    res += 1
+                i += 1
+        return res
+```
 
+```python
+class Solution:
+    def heightChecker(self, heights: List[int]) -> int:
+        expected = sorted(heights)
+        return sum(1 for i, h in enumerate(heights) if h != expected[i])
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Solution {
+    public int heightChecker(int[] heights) {
+        int[] expected = Arrays.copyOf(heights, heights.length);
+        Arrays.sort(expected);
+        int res = 0;
+        for (int i = 0; i < heights.length; ++i) {
+            if (heights[i] != expected[i]) {
+                ++res;
+            }
+        }
+        return res;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int heightChecker(vector<int>& heights) {
+        vector<int> expected = heights;
+        sort(expected.begin(), expected.end());
+        int res = 0;
+        for (int i = 0; i < heights.size(); ++i)
+        {
+            if (heights[i] != expected[i]) ++res;
+        }
+        return res;
+    }
+};
+```
 
+### **Go**
+
+```go
+func heightChecker(heights []int) int {
+    expected := make([]int, len(heights))
+    copy(expected, heights)
+    sort.Ints(expected)
+    res := 0
+    for i, h := range heights {
+        if h != expected[i] {
+            res++
+        }
+    }
+    return res
+}
 ```
 
 ### **...**

solution/1000-1099/1051.Height Checker/README_EN.md

@@ -52,21 +52,86 @@ All indices match.
 	<li><code>1 &lt;= heights[i] &lt;= 100</code></li>
 </ul>
 
-
 ## Solutions
 
 <!-- tabs:start -->
 
 ### **Python3**
 
 ```python
+class Solution:
+    def heightChecker(self, heights: List[int]) -> int:
+        bucket = [0] * 101
+        for h in heights:
+            bucket[h] += 1
+        res = i = 0
+        for j in range(1, 101):
+            while bucket[j] > 0:
+                bucket[j] -= 1
+                if heights[i] != j:
+                    res += 1
+                i += 1
+        return res
+```
 
+```python
+class Solution:
+    def heightChecker(self, heights: List[int]) -> int:
+        expected = sorted(heights)
+        return sum(1 for i, h in enumerate(heights) if h != expected[i])
 ```
 
 ### **Java**
 
 ```java
+class Solution {
+    public int heightChecker(int[] heights) {
+        int[] expected = Arrays.copyOf(heights, heights.length);
+        Arrays.sort(expected);
+        int res = 0;
+        for (int i = 0; i < heights.length; ++i) {
+            if (heights[i] != expected[i]) {
+                ++res;
+            }
+        }
+        return res;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int heightChecker(vector<int>& heights) {
+        vector<int> expected = heights;
+        sort(expected.begin(), expected.end());
+        int res = 0;
+        for (int i = 0; i < heights.size(); ++i)
+        {
+            if (heights[i] != expected[i]) ++res;
+        }
+        return res;
+    }
+};
+```
 
+### **Go**
+
+```go
+func heightChecker(heights []int) int {
+    expected := make([]int, len(heights))
+    copy(expected, heights)
+    sort.Ints(expected)
+    res := 0
+    for i, h := range heights {
+        if h != expected[i] {
+            res++
+        }
+    }
+    return res
+}
 ```
 
 ### **...**

solution/1000-1099/1051.Height Checker/Solution.cpp

@@ -0,0 +1,13 @@
+class Solution {
+public:
+    int heightChecker(vector<int>& heights) {
+        vector<int> copy = heights;
+        sort(copy.begin(), copy.end());
+        int res = 0;
+        for (int i = 0; i < heights.size(); ++i)
+        {
+            if (heights[i] != copy[i]) ++res;
+        }
+        return res;
+    }
+};

solution/1000-1099/1051.Height Checker/Solution.go

@@ -0,0 +1,12 @@
+func heightChecker(heights []int) int {
+	expected := make([]int, len(heights))
+	copy(expected, heights)
+	sort.Ints(expected)
+	res := 0
+	for i, h := range heights {
+		if h != expected[i] {
+			res++
+		}
+	}
+	return res
+}

solution/1000-1099/1051.Height Checker/Solution.java

@@ -1,13 +1,13 @@
 class Solution {
     public int heightChecker(int[] heights) {
-        int[] copy = Arrays.copyOf(heights, heights.length);
-        Arrays.sort(copy);
+        int[] expected = Arrays.copyOf(heights, heights.length);
+        Arrays.sort(expected);
         int res = 0;
         for (int i = 0; i < heights.length; ++i) {
-            if (heights[i] != copy[i]) {
+            if (heights[i] != expected[i]) {
                 ++res;
             }
         }
         return res;
     }
-}
+}

solution/1000-1099/1051.Height Checker/Solution.py

@@ -0,0 +1,13 @@
+class Solution:
+    def heightChecker(self, heights: List[int]) -> int:
+        bucket = [0] * 101
+        for h in heights:
+            bucket[h] += 1
+        res = i = 0
+        for j in range(1, 101):
+            while bucket[j] > 0:
+                bucket[j] -= 1
+                if heights[i] != j:
+                    res += 1
+                i += 1
+        return res