mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 23:41:41 +08:00
update
This commit is contained in:
@@ -149,7 +149,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"23.2K\", \"totalSubmission\": \"35.1K\", \"totalAcceptedRaw\": 23241, \"totalSubmissionRaw\": 35126, \"acRate\": \"66.2%\"}",
|
||||
"stats": "{\"totalAccepted\": \"23.2K\", \"totalSubmission\": \"35.1K\", \"totalAcceptedRaw\": 23246, \"totalSubmissionRaw\": 35133, \"acRate\": \"66.2%\"}",
|
||||
"hints": [
|
||||
"You can find the length of a number by dividing it by 10 and then rounding it down again and again until this number becomes equal to 0. Add 1 if this number is negative.",
|
||||
"Traverse the matrix column-wise to find the maximum length in each column."
|
||||
|
Reference in New Issue
Block a user