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

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

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 6322,
"likes": 6351,
"dislikes": 376,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Search in Rotated Sorted Array\", \"titleSlug\": \"search-in-rotated-sorted-array\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Find Minimum in Rotated Sorted Array II\", \"titleSlug\": \"find-minimum-in-rotated-sorted-array-ii\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"874.6K\", \"totalSubmission\": \"1.8M\", \"totalAcceptedRaw\": 874584, \"totalSubmissionRaw\": 1829872, \"acRate\": \"47.8%\"}",
"stats": "{\"totalAccepted\": \"877.1K\", \"totalSubmission\": \"1.8M\", \"totalAcceptedRaw\": 877052, \"totalSubmissionRaw\": 1834706, \"acRate\": \"47.8%\"}",
"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?",