solves detect capital

Author: anishLearnsToCode

README.md

@@ -137,7 +137,7 @@
 | 506 | [Relative Ranks](https://leetcode.com/problems/relative-ranks) | Easy | [![Java](assets/java.png)](src/RelativeRanks.java) [![Python](assets/python.png)](python/relative_ranks.py) |
 | 507 | [Perfect Number](https://leetcode.com/problems/perfect-number) | Easy | [![Java](assets/java.png)](src/CheckPerfectNumber.java) [![Python](assets/python.png)](python/check_perfect_number.py) |
 | 509 | [Fibonacci Number](https://leetcode.com/problems/fibonacci-number) | Easy | [![Java](assets/java.png)](src/FibonacciNumber.java) [![Python](assets/python.png)](python/fibonacci_number.py) |
-| 520 | [Detect Capital](https://leetcode.com/problems/detect-capital) | Easy | |
+| 520 | [Detect Capital](https://leetcode.com/problems/detect-capital) | Easy | [![Java](assets/java.png)](src/DetectCapital.java) [![Python](assets/python.png)](python/detect_capital.py) |
 | 521 | [Longest Uncommon Subsequence I](https://leetcode.com/problems/longest-uncommon-subsequence-i) | Easy | |
 | 530 | [Minimum Absolute Difference in BST](https://leetcode.com/problems/minimum-absolute-difference-in-bst) | Easy | |
 | 532 | [K - Diff Pairs in Array](https://leetcode.com/problems/k-diff-pairs-in-an-array) | Easy | |

python/detect_capital.py

@@ -0,0 +1,9 @@
+class Solution:
+    def detectCapitalUse(self, word: str) -> bool:
+        return word.isupper() or word.islower() or word[0].isupper() and self.isLower(word, 1)
+
+    def isLower(self, word: str, start: int) -> bool:
+        for index in range(start, len(word)):
+            if word[index].isupper():
+                return False
+        return True

src/DetectCapital.java

@@ -0,0 +1,27 @@
+public class DetectCapital {
+    public boolean detectCapitalUse(String word) {
+        return isAllCaps(word) || isAllLowerCase(word, 0) || firstCharIsCapital(word);
+    }
+
+    private boolean isAllCaps(String string) {
+        for (int index = 0 ; index < string.length() ; index++) {
+            if (Character.isLowerCase(string.charAt(index))) {
+                return false;
+            }
+        }
+        return true;
+    }
+
+    private boolean isAllLowerCase(String string, int start) {
+        for (int index = start ; index < string.length() ; index++) {
+            if (Character.isUpperCase(string.charAt(index))) {
+                return false;
+            }
+        }
+        return true;
+    }
+
+    private boolean firstCharIsCapital(String string) {
+        return Character.isUpperCase(string.charAt(0)) && isAllLowerCase(string, 1);
+    }
+}