add problem #1051 solutions

Add problem #1051 solutions.

Author: Cuda-Chen

1051/main.c

@@ -0,0 +1,24 @@
+int cmp(const void *a, const void *b) {
+    int va = *(const int *)a;
+    int vb = *(const int *)b;
+    return (va > vb) - (va < vb);
+}
+
+int heightChecker(int* heights, int heightsSize){
+    int n = heightsSize;
+    int rightPosition[n];
+    for(int i = 0; i < n; i++) {
+        rightPosition[i] = heights[i];
+    }
+    
+    qsort(rightPosition, n, sizeof(int), cmp);
+    
+    int result = 0;
+    for(int i = 0; i < n; i++) {
+        if(rightPosition[i] != heights[i]) {
+            result++;
+        }
+    }
+    
+    return result;
+}

1051/main.cpp

@@ -0,0 +1,22 @@
+class Solution {
+public:
+    int heightChecker(vector<int>& heights) {
+        int n = heights.size();
+        int rightPosition[n];
+        
+        for(int i = 0; i < n; i++) {
+            rightPosition[i] = heights[i];
+        }
+        
+        sort(rightPosition, rightPosition + n);
+        
+        int result = 0;
+        for(int i = 0; i < n; i++) {
+            if(heights[i] != rightPosition[i]) {
+                result++;
+            }
+        }
+        
+        return result;
+    }
+};

1051/main.java

@@ -0,0 +1,20 @@
+class Solution {
+    public int heightChecker(int[] heights) {
+        int n = heights.length;
+        int[] rightPosition = new int[n];
+        for(int i = 0; i < n; i++) {
+            rightPosition[i] = heights[i];
+        }
+        
+        Arrays.sort(rightPosition);
+        
+        int result = 0;
+        for(int i = 0; i < n; i++) {
+            if(rightPosition[i] != heights[i]) {
+                result++;
+            }
+        }
+        
+        return result;
+    }
+}

1051/main.py

@@ -0,0 +1,15 @@
+class Solution:
+    def heightChecker(self, heights: List[int]) -> int:
+        n = len(heights)
+        rightPosition = [0] * n
+        for i in range(n):
+            rightPosition[i] = heights[i]
+            
+        rightPosition.sort()
+        
+        result = 0
+        for i in range(n):
+            if rightPosition[i] != heights[i]:
+                result += 1
+                
+        return result

1051/main.rb

@@ -0,0 +1,18 @@
+# @param {Integer[]} heights
+# @return {Integer}
+def height_checker(heights)
+    n = heights.size
+    rightPosition = Array.new(n)
+    n.times do |i|
+        rightPosition[i] = heights[i]
+    end
+    
+    rightPosition.sort!
+    
+    result = 0
+    n.times do |i|
+        result += 1 if rightPosition[i] != heights[i]
+    end
+    
+    result
+end