https://leetcode.cn/problems/array-nesting/

Author: masx200

README.md

@@ -10,6 +10,8 @@ leetcode 测试
 
 ##### 包含的内容如下
 
+https://leetcode.cn/problems/array-nesting/
+
 https://leetcode.cn/problems/super-ugly-number/
 
 https://leetcode.cn/problems/ugly-number-iii/

array-nesting/index.ts

@@ -0,0 +1,15 @@
+export default function arrayNesting(nums: number[]): number {
+    let ans = 0;
+    const n = nums.length;
+    const vis: boolean[] = new Array(n).fill(0);
+    for (let i = 0; i < n; ++i) {
+        let cnt = 0;
+        while (!vis[i]) {
+            vis[i] = true;
+            i = nums[i];
+            ++cnt;
+        }
+        ans = Math.max(ans, cnt);
+    }
+    return ans;
+}

super-ugly-number/index.ts

@@ -1,23 +1,23 @@
-export default function nthSuperUglyNumber(
-    n: number,
-    primes: number[]
-): number {
-    const dp: number[] = new Array(n + 1).fill(0);
-    const m = primes.length;
-    const pointers: number[] = new Array(m).fill(0);
-    const nums: number[] = new Array(m).fill(1);
-    for (let i = 1; i <= n; i++) {
-        let minNum = Number.MAX_SAFE_INTEGER;
-        for (let j = 0; j < m; j++) {
-            minNum = Math.min(minNum, nums[j]);
-        }
-        dp[i] = minNum;
-        for (let j = 0; j < m; j++) {
-            if (nums[j] == minNum) {
-                pointers[j]++;
-                nums[j] = dp[pointers[j]] * primes[j];
-            }
-        }
-    }
-    return dp[n];
-}
+export default function nthSuperUglyNumber(
+    n: number,
+    primes: number[],
+): number {
+    const dp: number[] = new Array(n + 1).fill(0);
+    const m = primes.length;
+    const pointers: number[] = new Array(m).fill(0);
+    const nums: number[] = new Array(m).fill(1);
+    for (let i = 1; i <= n; i++) {
+        let minNum = Number.MAX_SAFE_INTEGER;
+        for (let j = 0; j < m; j++) {
+            minNum = Math.min(minNum, nums[j]);
+        }
+        dp[i] = minNum;
+        for (let j = 0; j < m; j++) {
+            if (nums[j] == minNum) {
+                pointers[j]++;
+                nums[j] = dp[pointers[j]] * primes[j];
+            }
+        }
+    }
+    return dp[n];
+}