Several bug fixes and improvements (#945)

* Update Dockerfile for code debugging.

* Format Python code using Black.

* Improve dark theme by defining html classes for the figures, animations and cover images.

* Fix several glossary translation.

* Update a code comment.

* Fix climbing_stairs_backtrack: the pruning should not require the sorted choices list.

* Update the code of array and list traversal.

* Fix a rendering issue of README.md

* Update code of list traversal.

* Fix array_definition.png

* Update README.md

* Fix max_capacity_moving_short_board.png

* Fix array.dart

* Fix array.dart

* Fix array.dart

* Fix array.dart

codes/javascript/chapter_array_and_linkedlist/array.js

@@ -50,11 +50,11 @@ function traverse(nums) {
     let count = 0;
     // 通过索引遍历数组
     for (let i = 0; i < nums.length; i++) {
-        count++;
+        count += nums[i];
     }
-    // 直接遍历数组
+    // 直接遍历数组元素
     for (const num of nums) {
-        count += 1;
+        count += num;
     }
 }
 

codes/javascript/chapter_array_and_linkedlist/list.js

@@ -39,13 +39,12 @@ console.log(`删除索引 3 处的元素，得到 nums = ${nums}`);
 /* 通过索引遍历列表 */
 let count = 0;
 for (let i = 0; i < nums.length; i++) {
-    count++;
+    count += nums[i];
 }
-
 /* 直接遍历列表元素 */
 count = 0;
-for (const n of nums) {
-    count++;
+for (const x of nums) {
+    count += x;
 }
 
 /* 拼接两个列表 */

codes/javascript/chapter_dynamic_programming/climbing_stairs_backtrack.js

@@ -11,7 +11,7 @@ function backtrack(choices, state, n, res) {
     // 遍历所有选择
     for (const choice of choices) {
         // 剪枝：不允许越过第 n 阶
-        if (state + choice > n) break;
+        if (state + choice > n) continue;
         // 尝试：做出选择，更新状态
         backtrack(choices, state + choice, n, res);
         // 回退