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-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/originData/[no content]leftmost-column-with-at-least-a-one.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Medium",
"likes": 913,
"dislikes": 111,
"likes": 938,
"dislikes": 112,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[[0,0],[1,1]]\n[[0,0],[0,1]]\n[[0,0],[0,0]]",
@@ -46,7 +46,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"143.5K\", \"totalSubmission\": \"273.7K\", \"totalAcceptedRaw\": 143547, \"totalSubmissionRaw\": 273691, \"acRate\": \"52.4%\"}",
"stats": "{\"totalAccepted\": \"146.3K\", \"totalSubmission\": \"278.7K\", \"totalAcceptedRaw\": 146284, \"totalSubmissionRaw\": 278681, \"acRate\": \"52.5%\"}",
"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."