| @@ -0,0 +1,16 @@ | |||
| class Solution: | |||
| def lengthOfLastWord(self, s: str) -> int: | |||
| s = s.strip() | |||
| for i in range(len(s) - 1, -1, -1): | |||
| if s[i] == " ": | |||
| print("Found space at", i, len(s) - 1) | |||
| if i == len(s) - 1: | |||
| return 0 | |||
| else: | |||
| return len(s[i+1:]) | |||
| return len(s) | |||
| s = Solution() | |||
| print("Expected: 0") | |||
| print("Got:", s.lengthOfLastWord("Test")) | |||
| @@ -0,0 +1,10 @@ | |||
| Given a string s consists of upper/lower-case alphabets and empty space characters ' ', return the length of last word (last word means the last appearing word if we loop from left to right) in the string. | |||
| If the last word does not exist, return 0. | |||
| Note: A word is defined as a maximal substring consisting of non-space characters only. | |||
| Example: | |||
| Input: "Hello World" | |||
| Output: 5 | |||
| @@ -0,0 +1,3 @@ | |||
| #!/bin/bash | |||
| python3 main.py | |||