Review: Algorithm: leetcode 96. Unique Binary Search Trees - カタラン数で数えるBSTの個数

Author: myoshi2891

Algorithm/BinarySearch/leetcode/96. Unique Binary Search Trees/claude 4.5 sonnet/README_react.html

@@ -689,7 +689,6 @@ <h3 class="text-xl font-semibold text-teal-800 mt-8 mb-4">他手法との比較<
             src="https://unpkg.com/react-dom@18/umd/react-dom.production.min.js"
         ></script>
 
-
         <!-- Prism.js -->
         <script src="https://cdnjs.cloudflare.com/ajax/libs/prism/1.29.0/prism.min.js"></script>
         <script src="https://cdnjs.cloudflare.com/ajax/libs/prism/1.29.0/components/prism-python.min.js"></script>
@@ -699,6 +698,5 @@ <h3 class="text-xl font-semibold text-teal-800 mt-8 mb-4">他手法との比較<
 
         <!-- Step-by-step React demo -->
         <script defer src="./StepByStepDemo.js"></script>
-
     </body>
 </html>

Algorithm/BinarySearch/leetcode/96. Unique Binary Search Trees/claude 4.5 sonnet/StepByStepDemo.js

@@ -388,6 +388,10 @@
     ))));
   }
   const container = document.getElementById("step-container");
-  const root = ReactDOM.createRoot(container);
-  root.render(/* @__PURE__ */ React.createElement(StepByStepDemo, null));
+  if (!container) {
+    console.error('Element with id "step-container" not found');
+  } else {
+    const root = ReactDOM.createRoot(container);
+    root.render(/* @__PURE__ */ React.createElement(StepByStepDemo, null));
+  }
 })();

Algorithm/BinarySearch/leetcode/96. Unique Binary Search Trees/claude 4.5 sonnet/StepByStepDemo.jsx

@@ -436,5 +436,9 @@ const { useState, useEffect, useRef } = React;
 
             // レンダリング
             const container = document.getElementById('step-container');
-            const root = ReactDOM.createRoot(container);
-            root.render(<StepByStepDemo />);
+            if (!container) {
+                console.error('Element with id "step-container" not found');
+            } else {
+                const root = ReactDOM.createRoot(container);
+                root.render(<StepByStepDemo />);
+            }