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

update

Browse Source
This commit is contained in:
小墨
2023-12-09 19:57:46 +08:00
parent 9bc4722a45
commit 3770b44d1e
4792 changed files with 10889 additions and 10886 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode-cn/originData/find-minimum-in-rotated-sorted-array.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"414.1K\", \"totalSubmission\": \"723.5K\", \"totalAcceptedRaw\": 414055, \"totalSubmissionRaw\": 723504, \"acRate\": \"57.2%\"}",
"stats": "{\"totalAccepted\": \"414.1K\", \"totalSubmission\": \"723.6K\", \"totalAcceptedRaw\": 414119, \"totalSubmissionRaw\": 723602, \"acRate\": \"57.2%\"}",
"hints": [
"Array was originally in ascending order. Now that the array is rotated, there would be a point in the array where there is a small deflection from the increasing sequence. eg. The array would be something like [4, 5, 6, 7, 0, 1, 2].",
"You can divide the search space into two and see which direction to go.\r\nCan you think of an algorithm which has O(logN) search complexity?",