https://leetcode.cn/problems/cycle-length-queries-in-a-tree

Author: masx200

README.md

@@ -45,6 +45,8 @@ Step 2. Add the dependency
 
 <summary>展开查看</summary>
 
+https://leetcode.cn/problems/cycle-length-queries-in-a-tree
+
 https://leetcode.cn/problems/two-sum-iii-data-structure-design/
 
 https://leetcode.cn/problems/minimum-adjacent-swaps-for-k-consecutive-ones

cycle-length-queries-in-a-tree/index.ts

@@ -0,0 +1,15 @@
+function cycleLengthQueries(_n: number, queries: number[][]): number[] {
+    return queries.map(([a, b]) => {
+        let ans = 1;
+        while (a !== b) {
+            if (a > b) {
+                a = a >> 1;
+            } else {
+                b = b >> 1;
+            }
+            ans++;
+        }
+        return ans;
+    });
+}
+export default cycleLengthQueries;