https://leetcode.cn/problems/check-if-array-is-sorted-and-rotated

Author: masx200

README.md

@@ -45,6 +45,8 @@ Step 2. Add the dependency
 
 <summary>展开查看</summary>
 
+https://leetcode.cn/problems/check-if-array-is-sorted-and-rotated
+
 https://leetcode.cn/problems/number-of-subarrays-with-bounded-maximum
 
 https://leetcode.cn/problems/maximum-number-of-balls-in-a-box

check-if-array-is-sorted-and-rotated/index.ts

@@ -0,0 +1,7 @@
+function check(nums: number[]): boolean {
+    return nums
+        .concat(nums)
+        .join()
+        .includes(nums.sort((a, b) => a - b).join());
+}
+export default check;

number-of-subarrays-with-bounded-maximum/index.ts

@@ -1,18 +1,18 @@
-function numSubarrayBoundedMax(
-    nums: number[],
-    left: number,
-    right: number
-): number {
-    return count(nums, right) - count(nums, left - 1);
-}
-
-function count(nums: number[], lower: number) {
-    let res = 0,
-        cur = 0;
-    for (const x of nums) {
-        cur = x <= lower ? cur + 1 : 0;
-        res += cur;
-    }
-    return res;
-}
-export default numSubarrayBoundedMax;
+function numSubarrayBoundedMax(
+    nums: number[],
+    left: number,
+    right: number,
+): number {
+    return count(nums, right) - count(nums, left - 1);
+}
+
+function count(nums: number[], lower: number) {
+    let res = 0,
+        cur = 0;
+    for (const x of nums) {
+        cur = x <= lower ? cur + 1 : 0;
+        res += cur;
+    }
+    return res;
+}
+export default numSubarrayBoundedMax;