feat: add solutions to lc problem: No.1752

No.1752.Check if Array Is Sorted and Rotated

Author: YangFong

solution/1700-1799/1752.Check if Array Is Sorted and Rotated/README.md

@@ -126,6 +126,48 @@ func check(nums []int) bool {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function check(nums: number[]): boolean {
+    const n = nums.length;
+    return (
+        nums.reduce((r, v, i) => r + (v > nums[(i + 1) % n] ? 1 : 0), 0) <= 1
+    );
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn check(nums: Vec<i32>) -> bool {
+        let n = nums.len();
+        let mut count = 0;
+        for i in 0..n {
+            if nums[i] > nums[(i + 1) % n] {
+                count += 1;
+            }
+        }
+        count <= 1
+    }
+}
+```
+
+### **C**
+
+```c
+bool check(int *nums, int numsSize) {
+    int count = 0;
+    for (int i = 0; i < numsSize; i++) {
+        if (nums[i] > nums[(i + 1) % numsSize]) {
+            count++;
+        }
+    }
+    return count <= 1;
+}
+```
+
 ### **...**
 
 ```

solution/1700-1799/1752.Check if Array Is Sorted and Rotated/README_EN.md

@@ -106,6 +106,48 @@ func check(nums []int) bool {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function check(nums: number[]): boolean {
+    const n = nums.length;
+    return (
+        nums.reduce((r, v, i) => r + (v > nums[(i + 1) % n] ? 1 : 0), 0) <= 1
+    );
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn check(nums: Vec<i32>) -> bool {
+        let n = nums.len();
+        let mut count = 0;
+        for i in 0..n {
+            if nums[i] > nums[(i + 1) % n] {
+                count += 1;
+            }
+        }
+        count <= 1
+    }
+}
+```
+
+### **C**
+
+```c
+bool check(int *nums, int numsSize) {
+    int count = 0;
+    for (int i = 0; i < numsSize; i++) {
+        if (nums[i] > nums[(i + 1) % numsSize]) {
+            count++;
+        }
+    }
+    return count <= 1;
+}
+```
+
 ### **...**
 
 ```

solution/1700-1799/1752.Check if Array Is Sorted and Rotated/Solution.c

@@ -0,0 +1,9 @@
+bool check(int *nums, int numsSize) {
+    int count = 0;
+    for (int i = 0; i < numsSize; i++) {
+        if (nums[i] > nums[(i + 1) % numsSize]) {
+            count++;
+        }
+    }
+    return count <= 1;
+}

solution/1700-1799/1752.Check if Array Is Sorted and Rotated/Solution.rs

@@ -0,0 +1,12 @@
+impl Solution {
+    pub fn check(nums: Vec<i32>) -> bool {
+        let n = nums.len();
+        let mut count = 0;
+        for i in 0..n {
+            if nums[i] > nums[(i + 1) % n] {
+                count += 1;
+            }
+        }
+        count <= 1
+    }
+}

solution/1700-1799/1752.Check if Array Is Sorted and Rotated/Solution.ts

@@ -0,0 +1,6 @@
+function check(nums: number[]): boolean {
+    const n = nums.length;
+    return (
+        nums.reduce((r, v, i) => r + (v > nums[(i + 1) % n] ? 1 : 0), 0) <= 1
+    );
+}