Add Solution to Detect Capital

Yi Gu · Yi Gu · commit 9ca65f9bb402 · 2017-03-28T22:31:12.000-07:00
diff --git a/README.md b/README.md
@@ -27,7 +27,7 @@
 * [Microsoft](#microsoft)
 
 ## Progress
-[Problem Status](#problem-status) shows the latest progress to all 400+ questions. Currently we have 215 completed solutions. Note: questions with &hearts; mark means that you have to **Subscript to premium membership** of LeetCode to unlock them. Thank you for great contributions from [CharleneJiang](https://github.com/CharleneJiang), [ReadmeCritic](https://github.com/ReadmeCritic), [demonkoo](https://github.com/demonkoo), [DaiYue](https://github.com/DaiYue), [Quaggie](https://github.com/Quaggie) and [jindulys](https://github.com/jindulys).
+[Problem Status](#problem-status) shows the latest progress to all 500+ questions. Currently we have 216 completed solutions. Note: questions with &hearts; mark means that you have to **Subscript to premium membership** of LeetCode to unlock them. Thank you for great contributions from [CharleneJiang](https://github.com/CharleneJiang), [ReadmeCritic](https://github.com/ReadmeCritic), [demonkoo](https://github.com/demonkoo), [DaiYue](https://github.com/DaiYue), [Quaggie](https://github.com/Quaggie) and [jindulys](https://github.com/jindulys).
 
 
 ## Array
@@ -74,6 +74,7 @@
 [Fizz Buzz](https://leetcode.com/problems/fizz-buzz/)| [Swift](./FizzBuzz.swift)| Easy| O(n)| O(1)|
 [Keyboard Row](https://leetcode.com/problems/keyboard-row/)| [Swift](./KeyboardRow.swift)| Easy| O(nm)| O(n)|
 [Valid Palindrome](https://leetcode.com/problems/valid-palindrome/)| [Swift](./String/ValidPalindrome.swift)| Easy| O(n)| O(n)|
+[Detect Capital](https://leetcode.com/problems/detect-capital/)| [Swift](./String/DetectCapital.swift)| Easy| O(n)| O(1)|
 [Count and Say](https://leetcode.com/problems/count-and-say/)| [Swift](./String/CountAndSay.swift)| Easy| O(n^2)| O(n)|
 [Flip Game](https://leetcode.com/problems/flip-game/)| [Swift](./String/FlipGame.swift)| Easy| O(n)| O(n)|
 [Implement strStr()](https://leetcode.com/problems/implement-strstr/)| [Swift](./String/StrStr.swift)| Easy| O(nm)| O(n)|
diff --git a/String/DetectCapital.swift b/String/DetectCapital.swift
@@ -0,0 +1,31 @@
+/**
+ * Question Link: https://leetcode.com/problems/detect-capital/
+ * Primary idea: Counts uppercased characters then compare to the standards.
+ *
+ * Time Complexity: O(n), Space Complexity: O(1)
+ *
+ */
+
+class DetectCapital {
+    func detectCapitalUse(_ word: String) -> Bool {
+        var capitalNum = 0, isFirstUpperCased = false
+  
+        for char in word.characters {
+            if char.isUpperCased() {
+                capitalNum += 1
+            }
+        }
+        
+        if let firstChar = word.characters.first {
+            isFirstUpperCased = firstChar.isUpperCased()
+        }
+  
+        return capitalNum == 0 || (capitalNum == 1 && isFirstUpperCased) || capitalNum == word.characters.count
+    }
+}
+
+fileprivate extension Character {
+  func isUpperCased() -> Bool {
+    return String(self).uppercased() == String(self)
+  }
+}
