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/[no content]leftmost-column-with-at-least-a-one.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Medium",
"likes": 911,
"likes": 913,
"dislikes": 111,
"isLiked": null,
"similarQuestions": "[]",
@@ -46,7 +46,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"143.4K\", \"totalSubmission\": \"273.4K\", \"totalAcceptedRaw\": 143355, \"totalSubmissionRaw\": 273352, \"acRate\": \"52.4%\"}",
"stats": "{\"totalAccepted\": \"143.5K\", \"totalSubmission\": \"273.7K\", \"totalAcceptedRaw\": 143547, \"totalSubmissionRaw\": 273691, \"acRate\": \"52.4%\"}",
"hints": [
"1. (Binary Search) For each row do a binary search to find the leftmost one on that row and update the answer.",
"2. (Optimal Approach) Imagine there is a pointer p(x, y) starting from top right corner. p can only move left or down. If the value at p is 0, move down. If the value at p is 1, move left. Try to figure out the correctness and time complexity of this algorithm."