coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-07 00:11:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode-cn/originData/circus-tower-lcci.json
View File

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"9.5K\", \"totalSubmission\": \"34.5K\", \"totalAcceptedRaw\": 9513, \"totalSubmissionRaw\": 34470, \"acRate\": \"27.6%\"}",
"stats": "{\"totalAccepted\": \"9.8K\", \"totalSubmission\": \"35.6K\", \"totalAcceptedRaw\": 9826, \"totalSubmissionRaw\": 35639, \"acRate\": \"27.6%\"}",
"hints": [
"这个问题要求我们找出可以构建的最长的序列对，使其每个序列都在不断增长。如果你只需要一个元素不断增长呢?",
"如果你只需要序列对中的一个元素为递增序列，那么只对该序列排序就好了。你的最长序列实际上是所有序列对(而不是重复的序列，因为最长序列是需要严格递增的)。对于最初的问题，这说明了什么?",