Commit 240c757

authored

chore: update lc problem: No.2677 (doocs#1516)

1 parent 7c4d7c0 commit 240c757Copy full SHA for 240c757

File tree

-3

lines changed

-3

lines changed

Lines changed: 3 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -19,23 +19,23 @@`
`19`	`19`	`<pre>`
`20`	`20`	`<b>输入:</b>arr = [1,2,3,4,5], size = 1`
`21`	`21`	`<b>输出:</b>[[1],[2],[3],[4],[5]]`
`22`		`-<b>解释:</b>数组 <code>arr </code>被分割成了每个只有一个元素的子数组。`
	`22`	`+<b>解释:</b>数组 arr 被分割成了每个只有一个元素的子数组。`
`23`	`23`	`</pre>`
`24`	`24`
`25`	`25`	`<p><strong class="example">示例 2:</strong></p>`
`26`	`26`
`27`	`27`	`<pre>`
`28`	`28`	`<b>输入:</b>arr = [1,9,6,3,2], size = 3`
`29`	`29`	`<b>输出:</b>[[1,9,6],[3,2]]`
`30`		`-<b>解释:</b>数组 <code>arr </code>被分割成了每个有三个元素的子数组。然而,第二个子数组只有两个元素。`
	`30`	`+<b>解释:</b>数组 arr 被分割成了每个有三个元素的子数组。然而,第二个子数组只有两个元素。`
`31`	`31`	`</pre>`
`32`	`32`
`33`	`33`	`<p><strong class="example">示例 3:</strong></p>`
`34`	`34`
`35`	`35`	`<pre>`
`36`	`36`	`<b>输入:</b>arr = [8,5,3,2,6], size = 6`
`37`	`37`	`<b>输出:</b>[[8,5,3,2,6]]`
`38`		`-<b>解释:</b><code>size </code>大于 <code>arr.length </code>,因此所有元素都在第一个子数组中。`
	`38`	`+<b>解释:</b>size 大于 arr.length ,因此所有元素都在第一个子数组中。`
`39`	`39`	`</pre>`
`40`	`40`
`41`	`41`	`<p><strong class="example">示例 4:</strong></p>`

Lines changed: 1 addition & 0 deletions

Comments

(0)