feat: update lc problems: No.0322, No.0323 (#1573)

Author: thinkasany

solution/0300-0399/0322.Coin Change/README.md

@@ -17,14 +17,14 @@
 <p><strong>示例&nbsp;1：</strong></p>
 
 <pre>
-<strong>输入：</strong>coins = <code>[1, 2, 5]</code>, amount = <code>11</code>
-<strong>输出：</strong><code>3</code> 
+<strong>输入：</strong>coins = [1, 2, 5], amount = 11
+<strong>输出：</strong>3
 <strong>解释：</strong>11 = 5 + 5 + 1</pre>
 
 <p><strong>示例 2：</strong></p>
 
 <pre>
-<strong>输入：</strong>coins = <code>[2]</code>, amount = <code>3</code>
+<strong>输入：</strong>coins = [2], amount = 3
 <strong>输出：</strong>-1</pre>
 
 <p><strong>示例 3：</strong></p>

solution/0300-0399/0323.Number of Connected Components in an Undirected Graph/README.md

@@ -17,7 +17,7 @@
 <p><img src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0300-0399/0323.Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph/images/conn1-graph.jpg" /></p>
 
 <pre>
-<strong>输入: </strong><code>n = 5</code>, <code>edges = [[0, 1], [1, 2], [3, 4]]</code>
+<strong>输入: </strong>n = 5, edges = [[0, 1], [1, 2], [3, 4]]
 <strong>输出: </strong>2
 </pre>
 
@@ -26,7 +26,7 @@
 <p><img src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0300-0399/0323.Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph/images/conn2-graph.jpg" /></p>
 
 <pre>
-<strong>输入: </strong><code>n = 5,</code> <code>edges = [[0,1], [1,2], [2,3], [3,4]]</code>
+<strong>输入: </strong>n = 5, edges = [[0,1], [1,2], [2,3], [3,4]]
 <strong>输出:&nbsp;&nbsp;</strong>1</pre>
 
 <p>&nbsp;</p>

solution/config.py

@@ -29,6 +29,8 @@
     283,
     298,
     320,
+    322,
+    323,
     336,
     375,
     465,