Commit e5e5f55

authored

feat: add solutions to lc problems: No.3383,3384 (doocs#3850)

1 parent ff32fdd commit e5e5f55Copy full SHA for e5e5f55

File tree

+1620

-17

lines changed

+1620

-17

lines changed

Lines changed: 2 additions & 4 deletions

Original file line number	Diff line number	Diff line change
`@@ -72,7 +72,7 @@ tags:`
`72`	`72`
`73`	`73`	`观察棋盘我们发现,颜色相同的两个格子 $(x_1, y_1)$ 和 $(x_2, y_2)$ 满足 $x_1 + y_1$ 和 $x_2 + y_2$ 均为奇数或偶数。`
`74`	`74`
`75`		-因此,我们可以根据 `coordinates` 获取对应的坐标 $(x, y),ドル如果 $x + y$ 为奇数,则格子为白色,返回 `true`,否则返回 `false`。
	`75`	`+因此,我们可以根据 $\textit{coordinates}$ 获取对应的坐标 $(x, y),ドル如果 $x + y$ 为奇数,则格子为白色,返回 $\textit{true}$,否则返回 $\textit{false}$。`
`76`	`76`
`77`	`77`	`时间复杂度 $O(1),ドル空间复杂度 $O(1)$。`
`78`	`78`
`@@ -142,9 +142,7 @@ impl Solution {`
`142`	`142`	`* @return {boolean}`
`143`	`143`	`*/`
`144`	`144`	`var squareIsWhite = function (coordinates) {`
`145`		`- const x = coordinates.charAt(0).charCodeAt();`
`146`		`- const y = coordinates.charAt(1).charCodeAt();`
`147`		`- return (x + y) % 2 == 1;`
	`145`	`+ return (coordinates[0].charCodeAt() + coordinates[1].charCodeAt()) % 2 == 1;`
`148`	`146`	`};`
`149`	`147`	```
`150`	`148`

Lines changed: 4 additions & 6 deletions

Original file line number	Diff line number	Diff line change
`@@ -66,11 +66,11 @@ tags:`
`66`	`66`
`67`	`67`	`<!-- solution:start -->`
`68`	`68`
`69`		`-### Solution 1: Find the Pattern`
	`69`	`+### Solution 1: Pattern Recognition`
`70`	`70`
`71`		`-By observing the chessboard, we find that two squares $(x_1, y_1)$ and $(x_2, y_2)$ with the same color satisfy that both $x_1 + y_1$ and $x_2 + y_2$ are either odd or even.`
	`71`	`+Observing the chessboard, we find that two squares $(x_1, y_1)$ and $(x_2, y_2)$ with the same color satisfy that both $x_1 + y_1$ and $x_2 + y_2$ are either odd or even.`
`72`	`72`
`73`		-Therefore, we can get the corresponding coordinates $(x, y)$ from `coordinates`. If $x + y$ is odd, then the square is white, return `true`, otherwisereturn `false`.
	`73`	`+Therefore, we can get the corresponding coordinates $(x, y)$ from $\textit{coordinates}$. If $x + y$ is odd, the square is white, and we return $\textit{true}$; otherwise, we return $\textit{false}$.`
`74`	`74`
`75`	`75`	`The time complexity is $O(1),ドル and the space complexity is $O(1)$.`
`76`	`76`
`@@ -140,9 +140,7 @@ impl Solution {`
`140`	`140`	`* @return {boolean}`
`141`	`141`	`*/`
`142`	`142`	`var squareIsWhite = function (coordinates) {`
`143`		`- const x = coordinates.charAt(0).charCodeAt();`
`144`		`- const y = coordinates.charAt(1).charCodeAt();`
`145`		`- return (x + y) % 2 == 1;`
	`143`	`+ return (coordinates[0].charCodeAt() + coordinates[1].charCodeAt()) % 2 == 1;`
`146`	`144`	`};`
`147`	`145`	```
`148`	`146`

Lines changed: 1 addition & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -3,7 +3,5 @@`
`3`	`3`	`* @return {boolean}`
`4`	`4`	`*/`
`5`	`5`	`var squareIsWhite = function (coordinates) {`
`6`		`- const x = coordinates.charAt(0).charCodeAt();`
`7`		`- const y = coordinates.charAt(1).charCodeAt();`
`8`		`- return (x + y) % 2 == 1;`
	`6`	`+ return (coordinates[0].charCodeAt() + coordinates[1].charCodeAt()) % 2 == 1;`
`9`	`7`	`};`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -33,7 +33,7 @@ tags:`
`33`	`33`
`34`	`34`	`</ul>`
`35`	`35`
`36`		`-<p>Your task is to determine the <strong>maximum</strong> length of ribbon, <code>x</code>, that allows you to cut <em>exactly</em> <code>k</code> ribbons, each of length <code>x</code>. You can discard any leftover ribbon from the cuts. If it is <strong>impossible</strong> to cut <code>k</code> ribbons of the same length, return 0.</p>`
	`36`	`+<p>Your task is to determine the <strong>maximum</strong> length of ribbon, <code>x</code>, that allows you to cut <em>at least</em> <code>k</code> ribbons, each of length <code>x</code>. You can discard any leftover ribbon from the cuts. If it is <strong>impossible</strong> to cut <code>k</code> ribbons of the same length, return 0.</p>`
`37`	`37`
`38`	`38`	`<p> </p>`
`39`	`39`	`<p><strong class="example">Example 1:</strong></p>`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -46,7 +46,7 @@ tags:`
`46`	`46`	`<strong>Input:</strong> banned = [4,3,5,6], n = 7, maxSum = 18`
`47`	`47`	`<strong>Output:</strong> 3`
`48`	`48`	`<strong>Explanation:</strong> You can choose the integers 1, 2, and 7.`
`49`		`-All these integers are in the range [1, 7], all do not appear in banned, and their sum is 18, which does not exceed maxSum.`
	`49`	`+All these integers are in the range [1, 7], all do not appear in banned, and their sum is 10, which does not exceed maxSum.`
`50`	`50`	`</pre>`
`51`	`51`
`52`	`52`	`<p> </p>`

Comments

(0)