Commit 8420e46

committed

fix: readme

1 parent d51afc4 commit 8420e46Copy full SHA for 8420e46

File tree

-1

lines changed

solution/2200-2299/2264.Largest 3-Same-Digit Number in String
- README.md
- README_EN.md

-1

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -68,7 +68,7 @@`
`68`	`68`
`69`	`69`	`若枚举完所有的 $i$ 都没有找到满足条件的字符串,则返回空字符串。`
`70`	`70`
`71`		`-时间复杂度 $O(10)`
	`71`	`+时间复杂度 $O(10 \times n),ドル其中 $n$ 是字符串 $num$ 的长度。空间复杂度 $O(1)$。`
`72`	`72`
`73`	`73`	`<!-- tabs:start -->`
`74`	`74`

Lines changed: 8 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -56,6 +56,14 @@`
`56`	`56`
`57`	`57`	`## Solutions`
`58`	`58`
	`59`	`+Solution 1: Enumeration`
	`60`	`+`
	`61`	`+We can enumerate each digit $i$ from large to small, where 0ドル \le i \le 9,ドル and then check whether the string $s$ consisting of three consecutive $i$ is a substring of $num$. If it is, we directly return $s$.`
	`62`	`+`
	`63`	`+If we have enumerated all the possible values of $i$ and still haven't found a substring that satisfies the condition, we return an empty string.`
	`64`	`+`
	`65`	`+The time complexity is $O(10 \times n),ドル where $n$ is the length of the string $num$. The space complexity is $O(1)$.`
	`66`	`+`
`59`	`67`	`<!-- tabs:start -->`
`60`	`68`
`61`	`69`	`### Python3`

Comments

(0)