LeetCode Solutions
520. Detect Capital
Time: $O(n)$ Space: $O(1)$
class Solution {
public:
bool detectCapitalUse(string word) {
for (int i = 1; i < word.length(); ++i)
if (isupper(word[1]) != isupper(word[i]) ||
islower(word[0]) && isupper(word[i]))
return false;
return true;
}
};
class Solution {
public boolean detectCapitalUse(String word) {
return word.equals(word.toUpperCase()) ||
word.substring(1).equals(word.substring(1).toLowerCase());
}
}
class Solution:
def detectCapitalUse(self, word: str) -> bool:
return word.isupper() or word.islower() or word.istitle()