Commit 3c1b9ee

author

Shuo

authored

Merge pull request #577 from openset/develop

Add: Related Topics

2 parents b8a8f59 + 5cdf6fe commit 3c1b9eeCopy full SHA for 3c1b9ee

File tree

+40

-1

lines changed

+40

-1

lines changed

Lines changed: 9 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -38,3 +38,12 @@`
`38`	`38`	`<li><code>arr1[i]</code> is <code>0</code> or <code>1</code></li>`
`39`	`39`	`<li><code>arr2[i]</code> is <code>0</code> or <code>1</code></li>`
`40`	`40`	`</ol>`
	`41`	`+`
	`42`	`+### Related Topics`
	`43`	`+ [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)]`
	`44`	`+`
	`45`	`+### Hints`
	`46`	`+<details>`
	`47`	`+<summary>Hint 1</summary>`
	`48`	`+We can try to determine the last digit of the answer, then divide everything by 2 and repeat.`
	`49`	`+</details>`

Lines changed: 9 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -60,3 +60,12 @@`
`60`	`60`	`</div>`
`61`	`61`	`</div>`
`62`	`62`	`</div>`
	`63`	`+`
	`64`	`+### Related Topics`
	`65`	`+ [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)]`
	`66`	`+`
	`67`	`+### Hints`
	`68`	`+<details>`
	`69`	`+<summary>Hint 1</summary>`
	`70`	`+Flipping a subset of columns is like doing a bitwise XOR of some number K onto each row. We want rows X with X ^ K = all 0s or all 1s. This is the same as X = X^K ^K = (all 0s or all 1s) ^ K, so we want to count rows that have opposite bits set. For example, if K = 1, then we count rows X = (00000...001, or 1111....110).`
	`71`	`+</details>`

Lines changed: 10 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -9,7 +9,7 @@`
`9`	`9`
`10`	`10`	`[Next >](https://github.com/openset/leetcode/tree/master/problems/flip-columns-for-maximum-number-of-equal-rows "Flip Columns For Maximum Number of Equal Rows")`
`11`	`11`
`12`		`-## 5076. Greatest Common Divisor of Strings (Easy)`
	`12`	`+## 1071. Greatest Common Divisor of Strings (Easy)`
`13`	`13`
`14`	`14`	`<p>For strings <code>S</code> and <code>T</code>, we say "<code>T</code> divides <code>S</code>" if and only if <code>S = T + ... + T</code>  (<code>T</code> concatenated with itself 1 or more times)</p>`
`15`	`15`
`@@ -47,3 +47,12 @@`
`47`	`47`	`<li><code>1 <= str2.length <= 1000</code></li>`
`48`	`48`	`<li><code>str1[i]</code> and <code>str2[i]</code> are English uppercase letters.</li>`
`49`	`49`	`</ol>`
	`50`	`+`
	`51`	`+### Related Topics`
	`52`	`+ [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)]`
	`53`	`+`
	`54`	`+### Hints`
	`55`	`+<details>`
	`56`	`+<summary>Hint 1</summary>`
	`57`	`+The greatest common divisor must be a prefix of each string, so we can try all prefixes.`
	`58`	`+</details>`

Lines changed: 12 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -47,3 +47,15 @@ Next >`
`47`	`47`	`<li><code>-1000 <= matrix[i] <= 1000</code></li>`
`48`	`48`	`<li><code>-10^8 <= target <= 10^8</code></li>`
`49`	`49`	`</ol>`
	`50`	`+`
	`51`	`+### Related Topics`
	`52`	`+ [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)]`
	`53`	`+ [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)]`
	`54`	`+ [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)]`
	`55`	`+`
	`56`	`+### Hints`
	`57`	`+<details>`
	`58`	`+<summary>Hint 1</summary>`
	`59`	`+Using a 2D prefix sum, we can query the sum of any submatrix in O(1) time.`
	`60`	`+Now for each (r1, r2), we can find the largest sum of a submatrix that uses every row in [r1, r2] in linear time using a sliding window.`
	`61`	`+</details>`

Comments

(0)