Commit 16116c4

authored

perf: update python solution to lc problem: No.3019 (doocs#3936)

1 parent 443c0ec commit 16116c4Copy full SHA for 16116c4

File tree

-5

lines changed

-5

lines changed

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -31,7 +31,7 @@ tags:`
`31`	`31`	`<pre>`
`32`	`32`	`<strong>输入:</strong>s = "aAbBcC"`
`33`	`33`	`<strong>输出:</strong>2`
`34`		`-<strong>解释:</strong>`
	`34`	`+<strong>解释:</strong>`
`35`	`35`	`从 s[0] = 'a' 到 s[1] = 'A',不存在按键变更,因为不计入 caps lock 或 shift 。`
`36`	`36`	`从 s[1] = 'A' 到 s[2] = 'b',按键变更。`
`37`	`37`	`从 s[2] = 'b' 到 s[3] = 'B',不存在按键变更,因为不计入 caps lock 或 shift 。`
`@@ -75,7 +75,7 @@ tags:`
`75`	`75`	```python
`76`	`76`	`class Solution:`
`77`	`77`	`def countKeyChanges(self, s: str) -> int:`
`78`		`- return sum(a.lower() != b.lower() for a, b in pairwise(s))`
	`78`	`+ return sum(a != b for a, b in pairwise(s.lower()))`
`79`	`79`	```
`80`	`80`
`81`	`81`	`#### Java`

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -30,7 +30,7 @@ tags:`
`30`	`30`	`<pre>`
`31`	`31`	`<strong>Input:</strong> s = "aAbBcC"`
`32`	`32`	`<strong>Output:</strong> 2`
`33`		`-<strong>Explanation:</strong>`
	`33`	`+<strong>Explanation:</strong>`
`34`	`34`	`From s[0] = 'a' to s[1] = 'A', there is no change of key as caps lock or shift is not counted.`
`35`	`35`	`From s[1] = 'A' to s[2] = 'b', there is a change of key.`
`36`	`36`	`From s[2] = 'b' to s[3] = 'B', there is no change of key as caps lock or shift is not counted.`
`@@ -74,7 +74,7 @@ The time complexity is $O(n),ドル where $n$ is the length of the string $s$. The sp`
`74`	`74`	```python
`75`	`75`	`class Solution:`
`76`	`76`	`def countKeyChanges(self, s: str) -> int:`
`77`		`- return sum(a.lower() != b.lower() for a, b in pairwise(s))`
	`77`	`+ return sum(a != b for a, b in pairwise(s.lower()))`
`78`	`78`	```
`79`	`79`
`80`	`80`	`#### Java`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -1,3 +1,3 @@`
`1`	`1`	`class Solution:`
`2`	`2`	`def countKeyChanges(self, s: str) -> int:`
`3`		`- return sum(a.lower() != b.lower() for a, b in pairwise(s))`
	`3`	`+ return sum(a != b for a, b in pairwise(s.lower()))`

Comments

(0)