solve problem Detect Capital

Author: P-ppc

README.md

@@ -31,4 +31,5 @@ All solutions will be accepted!
 |20|[Valid Parentheses](https://leetcode-cn.com/problems/valid-parentheses/description/)|[java/py/js](./algorithms/ValidParentheses)|Easy|
 |485|[Max Consecutive Ones](https://leetcode-cn.com/problems/max-consecutive-ones/description/)|[java/py/js](./algorithms/MaxConsecutiveOnes)|Easy|
 |191|[Number Of 1 Bits](https://leetcode-cn.com/problems/number-of-1-bits/description/)|[java/py/js](./algorithms/NumberOf1Bits)|Easy|
-|258|[Add Digits](https://leetcode-cn.com/problems/add-digits/description/)|[java/py/js](./algorithms/AddDigits)|Easy|
+|258|[Add Digits](https://leetcode-cn.com/problems/add-digits/description/)|[java/py/js](./algorithms/AddDigits)|Easy|
+|520|[Detect Capital](https://leetcode-cn.com/problems/detect-capital/description/)|[java/py/js](./algorithms/DetectCaptial)|Easy|

algorithms/DetectCapital/README.md

@@ -0,0 +1,2 @@
+# Detect Capital
+This problem is easy to solve

algorithms/DetectCapital/Solution.java

@@ -0,0 +1,17 @@
+class Solution {
+    public boolean detectCapitalUse(String word) {
+        int upperCount = 0,
+            lowerCount = 0;
+        for (char c : word.toCharArray()) {
+            int v = (int) c;
+            if (65 <= v && v <= 90) {
+                if (lowerCount > 0) return false;
+                upperCount += 1;
+            } else {
+                if (upperCount > 1) return false;
+                lowerCount += 1;
+            }
+        }
+        return true;
+    }
+}

algorithms/DetectCapital/solution.js

@@ -0,0 +1,21 @@
+/**
+ * @param {string} word
+ * @return {boolean}
+ */
+var detectCapitalUse = function(word) {
+    let upperCount = 0,
+        lowerCount = 0,
+        list = word.split('')
+    
+    for (let i = 0; i < list.length; i++) {
+        if (65 <= list[i].charCodeAt(0) && list[i].charCodeAt(0) <= 90) {
+            if (lowerCount > 0) return false
+            upperCount += 1
+        } else {
+            if (upperCount > 1) return false
+            lowerCount += 1
+        }     
+    }
+
+    return true
+};

algorithms/DetectCapital/solution.py

@@ -0,0 +1,18 @@
+class Solution(object):
+    def detectCapitalUse(self, word):
+        """
+        :type word: str
+        :rtype: bool
+        """
+        upper_count = 0
+        lower_count = 0
+        for c in word:
+            if 65 <= ord(c) <= 90:
+                if lower_count > 0:
+                    return False
+                upper_count += 1
+            else:
+                if upper_count > 1:
+                    return False
+                lower_count += 1
+        return True