Commit 3970415

committed

feat: update solutions to leetcode problem: No.0058

1 parent e91e547 commit 3970415Copy full SHA for 3970415

File tree

+83

-6

lines changed

+83

-6

lines changed

Lines changed: 29 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -30,15 +30,42 @@`
`30`	`30`	`<!-- 这里可写当前语言的特殊实现逻辑 -->`
`31`	`31`
`32`	`32`	```python
`33`		`-`
	`33`	`+class Solution:`
	`34`	`+ def lengthOfLastWord(self, s: str) -> int:`
	`35`	`+ last_word_length = 0`
	`36`	`+ meet_word = False`
	`37`	`+ for i in range(len(s) - 1, -1, -1):`
	`38`	`+ ch = ord(s[i])`
	`39`	`+ if ch >= 65 and ch <= 122:`
	`40`	`+ meet_word = True`
	`41`	`+ last_word_length += 1`
	`42`	`+ elif meet_word:`
	`43`	`+ break`
	`44`	`+ return last_word_length`
`34`	`45`	```
`35`	`46`
`36`	`47`	`### Java`
`37`	`48`
`38`	`49`	`<!-- 这里可写当前语言的特殊实现逻辑 -->`
`39`	`50`
`40`	`51`	```java
`41`		`-`
	`52`	`+class Solution {`
	`53`	`+ public int lengthOfLastWord(String s) {`
	`54`	`+ int n = s.length();`
	`55`	`+ int lastWordLength = 0;`
	`56`	`+ boolean meetWord = false;`
	`57`	`+ for (int i = n - 1; i >= 0; --i) {`
	`58`	`+ char ch = s.charAt(i);`
	`59`	`+ if (ch >= 'A' && ch <= 'z') {`
	`60`	`+ meetWord = true;`
	`61`	`+ ++lastWordLength;`
	`62`	`+ } else if (meetWord) {`
	`63`	`+ break;`
	`64`	`+ }`
	`65`	`+ }`
	`66`	`+ return lastWordLength;`
	`67`	`+ }`
	`68`	`+}`
`42`	`69`	```
`43`	`70`
`44`	`71`	`### ...`

Lines changed: 29 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -26,13 +26,40 @@`
`26`	`26`	`### Python3`
`27`	`27`
`28`	`28`	```python
`29`		`-`
	`29`	`+class Solution:`
	`30`	`+ def lengthOfLastWord(self, s: str) -> int:`
	`31`	`+ last_word_length = 0`
	`32`	`+ meet_word = False`
	`33`	`+ for i in range(len(s) - 1, -1, -1):`
	`34`	`+ ch = ord(s[i])`
	`35`	`+ if ch >= 65 and ch <= 122:`
	`36`	`+ meet_word = True`
	`37`	`+ last_word_length += 1`
	`38`	`+ elif meet_word:`
	`39`	`+ break`
	`40`	`+ return last_word_length`
`30`	`41`	```
`31`	`42`
`32`	`43`	`### Java`
`33`	`44`
`34`	`45`	```java
`35`		`-`
	`46`	`+class Solution {`
	`47`	`+ public int lengthOfLastWord(String s) {`
	`48`	`+ int n = s.length();`
	`49`	`+ int lastWordLength = 0;`
	`50`	`+ boolean meetWord = false;`
	`51`	`+ for (int i = n - 1; i >= 0; --i) {`
	`52`	`+ char ch = s.charAt(i);`
	`53`	`+ if (ch >= 'A' && ch <= 'z') {`
	`54`	`+ meetWord = true;`
	`55`	`+ ++lastWordLength;`
	`56`	`+ } else if (meetWord) {`
	`57`	`+ break;`
	`58`	`+ }`
	`59`	`+ }`
	`60`	`+ return lastWordLength;`
	`61`	`+ }`
	`62`	`+}`
`36`	`63`	```
`37`	`64`
`38`	`65`	`### ...`

Lines changed: 13 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,6 +1,17 @@`
`1`	`1`	`class Solution {`
`2`	`2`	`public int lengthOfLastWord(String s) {`
`3`		`- s = s.trim();`
`4`		`- return s.length()-s.lastIndexOf(" ")-1;`
	`3`	`+ int n = s.length();`
	`4`	`+ int lastWordLength = 0;`
	`5`	`+ boolean meetWord = false;`
	`6`	`+ for (int i = n - 1; i >= 0; --i) {`
	`7`	`+ char ch = s.charAt(i);`
	`8`	`+ if (ch >= 'A' && ch <= 'z') {`
	`9`	`+ meetWord = true;`
	`10`	`+ ++lastWordLength;`
	`11`	`+ } else if (meetWord) {`
	`12`	`+ break;`
	`13`	`+ }`
	`14`	`+ }`
	`15`	`+ return lastWordLength;`
`5`	`16`	`}`
`6`	`17`	`}`

Lines changed: 12 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,12 @@`
	`1`	`+class Solution:`
	`2`	`+ def lengthOfLastWord(self, s: str) -> int:`
	`3`	`+ last_word_length = 0`
	`4`	`+ meet_word = False`
	`5`	`+ for i in range(len(s) - 1, -1, -1):`
	`6`	`+ ch = ord(s[i])`
	`7`	`+ if ch >= 65 and ch <= 122:`
	`8`	`+ meet_word = True`
	`9`	`+ last_word_length += 1`
	`10`	`+ elif meet_word:`
	`11`	`+ break`
	`12`	`+ return last_word_length`

Comments

(0)