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/csharp/chapter_array_and_linkedlist/array.cs

@@ -50,11 +50,11 @@ public class array {
         int count = 0;
         // 通过索引遍历数组
         for (int i = 0; i < nums.Length; i++) {
-            count++;
+            count += nums[i];
         }
-        // 直接遍历数组
+        // 直接遍历数组元素
         foreach (int num in nums) {
-            count++;
+            count += num;
         }
     }
 

codes/csharp/chapter_array_and_linkedlist/list.cs

@@ -46,13 +46,12 @@ public class list {
         /* 通过索引遍历列表 */
         int count = 0;
         for (int i = 0; i < nums.Count; i++) {
-            count++;
+            count += nums[i];
         }
-
         /* 直接遍历列表元素 */
         count = 0;
-        foreach (int n in nums) {
-            count++;
+        foreach (int x in nums) {
+            count += x;
         }
 
         /* 拼接两个列表 */

codes/csharp/chapter_dynamic_programming/climbing_stairs_backtrack.cs

@@ -16,7 +16,7 @@ public class climbing_stairs_backtrack {
         foreach (int choice in choices) {
             // 剪枝：不允许越过第 n 阶
             if (state + choice > n)
-                break;
+                continue;
             // 尝试：做出选择，更新状态
             Backtrack(choices, state + choice, n, res);
             // 回退