coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-25 14:58:56 +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

4
leetcode-cn/originData/[no content]best-meeting-point.json
View File

@@ -12,7 +12,7 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Hard",
"likes": 88,
"likes": 91,
"dislikes": 0,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Shortest Distance from All Buildings\", \"titleSlug\": \"shortest-distance-from-all-buildings\", \"difficulty\": \"Hard\", \"translatedTitle\": \"\\u79bb\\u5efa\\u7b51\\u7269\\u6700\\u8fd1\\u7684\\u8ddd\\u79bb\"}, {\"title\": \"Minimum Moves to Equal Array Elements II\", \"titleSlug\": \"minimum-moves-to-equal-array-elements-ii\", \"difficulty\": \"Medium\", \"translatedTitle\": \"\\u6700\\u5c11\\u79fb\\u52a8\\u6b21\\u6570\\u4f7f\\u6570\\u7ec4\\u5143\\u7d20\\u76f8\\u7b49 II\"}]",
@@ -46,7 +46,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"3.1K\", \"totalSubmission\": \"5K\", \"totalAcceptedRaw\": 3082, \"totalSubmissionRaw\": 4950, \"acRate\": \"62.3%\"}",
"stats": "{\"totalAccepted\": \"3.2K\", \"totalSubmission\": \"5.1K\", \"totalAcceptedRaw\": 3190, \"totalSubmissionRaw\": 5123, \"acRate\": \"62.3%\"}",
"hints": [
"Try to solve it in one dimension first. How can this solution apply to the two dimension case?"
],