package com.fishercoder.solutions;

/**
 * 520. Detect Capital
 *
 * Given a word, you need to judge whether the usage of capitals in it is right or not.
 * We define the usage of capitals in a word to be right when one of the following cases holds:

 All letters in this word are capitals, like "USA".
 All letters in this word are not capitals, like "leetcode".
 Only the first letter in this word is capital if it has more than one letter, like "Google".
 Otherwise, we define that this word doesn't use capitals in a right way.

 Example 1:
 Input: "USA"
 Output: True
 
 Example 2:
 Input: "FlaG"
 Output: False

 Note: The input will be a non-empty word consisting of uppercase and lowercase latin letters.
 */
public class _520 {
    public static class Solution1 {
        public boolean detectCapitalUse(String word) {
            char[] words = word.toCharArray();
            boolean firstLetterCap = false;
            if (Character.isUpperCase(words[0])) {
                firstLetterCap = true;
            }

            if (firstLetterCap) {
                if (words.length >= 2) {
                    int i = 2;
                    if (Character.isUpperCase(words[1])) {
                        //then all following must be all uppercase
                        while (i < words.length) {
                            if (!Character.isUpperCase(words[i])) {
                                return false;
                            }
                            i++;
                        }
                        return true;
                    } else {
                        //then all following must be all lowercase
                        while (i < words.length) {
                            if (!Character.isLowerCase(words[i])) {
                                return false;
                            }
                            i++;
                        }
                        return true;
                    }
                }
                return true;
            } else {
                //then all following must be all lowercase
                int i = 1;
                while (i < words.length) {
                    if (!Character.isLowerCase(words[i])) {
                        return false;
                    }
                    i++;
                }
                return true;
            }
        }
    }
}

@@ -33,689 +33,8 @@
 s;%0A%0A
-/**%0A * 520. Detect Capital%0A *%0A * Given a word, you need to judge whether the usage of capitals in it is right or not.%0A * We define the usage of capitals in a word to be right when one of the following cases holds:%0A%0A All letters in this word are capitals, like %22USA%22.%0A All letters in this word are not capitals, like %22leetcode%22.%0A Only the first letter in this word is capital if it has more than one letter, like %22Google%22.%0A Otherwise, we define that this word doesn't use capitals in a right way.%0A%0A Example 1:%0A Input: %22USA%22%0A Output: True%0A %0A Example 2:%0A Input: %22FlaG%22%0A Output: False%0A%0A Note: The input will be a non-empty word consisting of uppercase and lowercase latin letters.%0A */%0A
 publ

refactor 520