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

update

Browse Source
This commit is contained in:
小墨
2022-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -40,7 +40,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"59.8K\", \"totalSubmission\": \"102.8K\", \"totalAcceptedRaw\": 59785, \"totalSubmissionRaw\": 102849, \"acRate\": \"58.1%\"}",
"stats": "{\"totalAccepted\": \"59.9K\", \"totalSubmission\": \"103K\", \"totalAcceptedRaw\": 59860, \"totalSubmissionRaw\": 102971, \"acRate\": \"58.1%\"}",
"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."