摘要:
At first, I thought we can use the permutation problem code to solve this problem. However, after some examination, I found the problem is quite diffe... 阅读全文
摘要:
First, we use binary search in the last column to find which row the target supposed to be in. Initially, we set rowLow = 0, rowHigh = row-1. The cond... 阅读全文
摘要:
Use additional O(m+n) space, simple improvement. Two array, one is of size row, to store the status of each row, whether there is a 0 element in the r... 阅读全文