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

update

Browse Source
This commit is contained in:
小墨
2022-03-29 16:56:27 +08:00
parent e730aa6794
commit ad15da05aa
2517 changed files with 7358 additions and 7332 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode-cn/originData/[no content]campus-bikes.json
View File

@@ -40,7 +40,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"3.4K\", \"totalSubmission\": \"7.1K\", \"totalAcceptedRaw\": 3437, \"totalSubmissionRaw\": 7118, \"acRate\": \"48.3%\"}",
"stats": "{\"totalAccepted\": \"3.4K\", \"totalSubmission\": \"7.1K\", \"totalAcceptedRaw\": 3445, \"totalSubmissionRaw\": 7127, \"acRate\": \"48.3%\"}",
"hints": [
"<p>Sort the elements by distance. In case of a tie, sort them by the index of the worker. After that, if there are still ties, sort them by the index of the bike.</p>\r\n\r\n<p>Can you do this in less than O(nlogn) time, where n is the total number of pairs between workers and bikes?</p>",
"Loop the sorted elements and match each pair of worker and bike if the given worker and bike where not used."