refactor: refine LeetCode 83 UI node arrow logic and fix JS documentation formatting

Author: myoshi2891

Algorithm/Other/leetcode/83. Remove Duplicates from Sorted List/Claude 4.6 extended/README_React.html

@@ -806,9 +806,11 @@ <h3 class="outfit font-bold text-teal-800 text-lg mb-3">アプローチ比較</h
                             const isActive = highlight && highlight.includes(i);
                             // find next non-skipped node
                             let hasNext = false;
+                            let nextIdx = -1;
                             for (let j = i + 1; j < allNodes.length; j++) {
                                 if (!allNodes[j].skip) {
                                     hasNext = true;
+                                    nextIdx = j;
                                     break;
                                 }
                             }
@@ -859,7 +861,7 @@ <h3 class="outfit font-bold text-teal-800 text-lg mb-3">アプローチ比較</h
                                         <line
                                             x1={nx + BOX + 4}
                                             y1={28 + BOX / 2}
-                                            x2={nx + BOX + ARR - 4}
+                                            x2={xPositions[nextIdx] - 4}
                                             y2={28 + BOX / 2}
                                             stroke="#64748b"
                                             strokeWidth="2"

JavaScript/2627. Debounce/Claude Code Sonnet 4.5 extended/README.md

@@ -507,7 +507,8 @@ def throttle(fn: Callable, t: float) -> Callable:
         if should_call:
             fn(*args, **kwargs)
 
-    return throttled```
+    return throttled
+```
 
 ### Q6. LeetCodeで提出できる？
 

public/Algorithm/Other/leetcode/83. Remove Duplicates from Sorted List/Claude 4.6 extended/README_React.html

@@ -806,9 +806,11 @@ <h3 class="outfit font-bold text-teal-800 text-lg mb-3">アプローチ比較</h
                             const isActive = highlight && highlight.includes(i);
                             // find next non-skipped node
                             let hasNext = false;
+                            let nextIdx = -1;
                             for (let j = i + 1; j < allNodes.length; j++) {
                                 if (!allNodes[j].skip) {
                                     hasNext = true;
+                                    nextIdx = j;
                                     break;
                                 }
                             }
@@ -859,7 +861,7 @@ <h3 class="outfit font-bold text-teal-800 text-lg mb-3">アプローチ比較</h
                                         <line
                                             x1={nx + BOX + 4}
                                             y1={28 + BOX / 2}
-                                            x2={nx + BOX + ARR - 4}
+                                            x2={xPositions[nextIdx] - 4}
                                             y2={28 + BOX / 2}
                                             stroke="#64748b"
                                             strokeWidth="2"