feat: add weekly contest 464

Author: yanglbme

solution/1200-1299/1277.Count Square Submatrices with All Ones/README.md

@@ -33,7 +33,7 @@ tags:
   [0,1,1,1]
 ]
 <strong>输出：</strong>15
-<strong>解释：</strong>
+<strong>解释：</strong> 
 边长为 1 的正方形有 <strong>10</strong> 个。
 边长为 2 的正方形有 <strong>4</strong> 个。
 边长为 3 的正方形有 <strong>1</strong> 个。
@@ -42,15 +42,15 @@ tags:
 
 <p><strong>示例 2：</strong></p>
 
-<pre><strong>输入：</strong>matrix =
+<pre><strong>输入：</strong>matrix = 
 [
   [1,0,1],
   [1,1,0],
   [1,1,0]
 ]
 <strong>输出：</strong>7
 <strong>解释：</strong>
-边长为 1 的正方形有 <strong>6</strong> 个。
+边长为 1 的正方形有 <strong>6</strong> 个。 
 边长为 2 的正方形有 <strong>1</strong> 个。
 正方形的总数 = 6 + 1 = <strong>7</strong>.
 </pre>

solution/1200-1299/1277.Count Square Submatrices with All Ones/README_EN.md

@@ -33,7 +33,7 @@ tags:
   [0,1,1,1]
 ]
 <strong>Output:</strong> 15
-<strong>Explanation:</strong>
+<strong>Explanation:</strong> 
 There are <strong>10</strong> squares of side 1.
 There are <strong>4</strong> squares of side 2.
 There is  <strong>1</strong> square of side 3.
@@ -43,16 +43,16 @@ Total number of squares = 10 + 4 + 1 = <strong>15</strong>.
 <p><strong class="example">Example 2:</strong></p>
 
 <pre>
-<strong>Input:</strong> matrix =
+<strong>Input:</strong> matrix = 
 [
   [1,0,1],
   [1,1,0],
   [1,1,0]
 ]
 <strong>Output:</strong> 7
-<strong>Explanation:</strong>
-There are <b>6</b> squares of side 1.
-There is <strong>1</strong> square of side 2.
+<strong>Explanation:</strong> 
+There are <b>6</b> squares of side 1.  
+There is <strong>1</strong> square of side 2. 
 Total number of squares = 6 + 1 = <b>7</b>.
 </pre>
 

solution/1500-1599/1504.Count Submatrices With All Ones/README_EN.md

@@ -30,11 +30,11 @@ tags:
 <pre>
 <strong>Input:</strong> mat = [[1,0,1],[1,1,0],[1,1,0]]
 <strong>Output:</strong> 13
-<strong>Explanation:</strong>
+<strong>Explanation:</strong> 
 There are 6 rectangles of side 1x1.
 There are 2 rectangles of side 1x2.
 There are 3 rectangles of side 2x1.
-There is 1 rectangle of side 2x2.
+There is 1 rectangle of side 2x2. 
 There is 1 rectangle of side 3x1.
 Total number of rectangles = 6 + 2 + 3 + 1 + 1 = 13.
 </pre>
@@ -44,14 +44,14 @@ Total number of rectangles = 6 + 2 + 3 + 1 + 1 = 13.
 <pre>
 <strong>Input:</strong> mat = [[0,1,1,0],[0,1,1,1],[1,1,1,0]]
 <strong>Output:</strong> 24
-<strong>Explanation:</strong>
+<strong>Explanation:</strong> 
 There are 8 rectangles of side 1x1.
 There are 5 rectangles of side 1x2.
-There are 2 rectangles of side 1x3.
+There are 2 rectangles of side 1x3. 
 There are 4 rectangles of side 2x1.
-There are 2 rectangles of side 2x2.
-There are 2 rectangles of side 3x1.
-There is 1 rectangle of side 3x2.
+There are 2 rectangles of side 2x2. 
+There are 2 rectangles of side 3x1. 
+There is 1 rectangle of side 3x2. 
 Total number of rectangles = 8 + 5 + 2 + 4 + 2 + 2 + 1 = 24.
 </pre>
 

solution/3600-3699/3648.Minimum Sensors to Cover Grid/README.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3600-3699/3648.Minimum%20Sensors%20to%20Cover%20Grid/README.md
+rating: 1395
+source: 第 163 场双周赛 Q1
 ---
 
 <!-- problem:start -->

solution/3600-3699/3648.Minimum Sensors to Cover Grid/README_EN.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3600-3699/3648.Minimum%20Sensors%20to%20Cover%20Grid/README_EN.md
+rating: 1395
+source: Biweekly Contest 163 Q1
 ---
 
 <!-- problem:start -->

solution/3600-3699/3649.Number of Perfect Pairs/README.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3600-3699/3649.Number%20of%20Perfect%20Pairs/README.md
+rating: 1715
+source: 第 163 场双周赛 Q2
 ---
 
 <!-- problem:start -->

solution/3600-3699/3649.Number of Perfect Pairs/README_EN.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3600-3699/3649.Number%20of%20Perfect%20Pairs/README_EN.md
+rating: 1715
+source: Biweekly Contest 163 Q2
 ---
 
 <!-- problem:start -->

solution/3600-3699/3650.Minimum Cost Path with Edge Reversals/README.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3600-3699/3650.Minimum%20Cost%20Path%20with%20Edge%20Reversals/README.md
+rating: 1853
+source: 第 163 场双周赛 Q3
 ---
 
 <!-- problem:start -->

solution/3600-3699/3650.Minimum Cost Path with Edge Reversals/README_EN.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3600-3699/3650.Minimum%20Cost%20Path%20with%20Edge%20Reversals/README_EN.md
+rating: 1853
+source: Biweekly Contest 163 Q3
 ---
 
 <!-- problem:start -->

solution/3600-3699/3651.Minimum Cost Path with Teleportations/README.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: 困难
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3600-3699/3651.Minimum%20Cost%20Path%20with%20Teleportations/README.md
+rating: 2411
+source: 第 163 场双周赛 Q4
 ---
 
 <!-- problem:start -->