update

leetcode/originData/spiral-matrix.json

@@ -11,8 +11,8 @@
             "translatedContent": null,
             "isPaidOnly": false,
             "difficulty": "Medium",
-            "likes": 6645,
-            "dislikes": 813,
+            "likes": 7051,
+            "dislikes": 825,
             "isLiked": null,
             "similarQuestions": "[{\"title\": \"Spiral Matrix II\", \"titleSlug\": \"spiral-matrix-ii\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Spiral Matrix III\", \"titleSlug\": \"spiral-matrix-iii\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
             "exampleTestcases": "[[1,2,3],[4,5,6],[7,8,9]]\n[[1,2,3,4],[5,6,7,8],[9,10,11,12]]",
@@ -149,7 +149,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"697.8K\", \"totalSubmission\": \"1.7M\", \"totalAcceptedRaw\": 697835, \"totalSubmissionRaw\": 1702937, \"acRate\": \"41.0%\"}",
+            "stats": "{\"totalAccepted\": \"723.2K\", \"totalSubmission\": \"1.7M\", \"totalAcceptedRaw\": 723234, \"totalSubmissionRaw\": 1746979, \"acRate\": \"41.4%\"}",
             "hints": [
                 "Well for some problems, the best way really is to come up with some algorithms for simulation. Basically, you need to simulate what the problem asks us to do.",
                 "We go boundary by boundary and move inwards. That is the essential operation. First row, last column, last row, first column and then we move inwards by 1 and then repeat. That's all, that is all the simulation that we need.",