leetcode 520. Detect Capital（C语言）

  第七天。
  520
贴题目：

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 thisword 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.

解析：
  本题就是看大写字母的位置使用是否正确。大写字母的判读用ascii码来判断。介于65及90之间即为大写字母。
  我觉得可能是我写智能车的程序写习惯了，总把代码风格写得和我之前写智能车程序的风格似的……=。=
  我觉得这个风格概括一下就是，每句代码尽量不重复，但看起来会很混乱，却又尽量地减少程序复杂度、减少程序的运算次数。（因为智能车要尽量提高单片机运算效率，减少程序的运算周期，从而使车反应更加灵敏。emmm……跑题了。）
神奇的代码风格：

bool detectCapitalUse(char* word) {
    int len=strlen(word);
    int flag=0;
    int cnt=0;//计大写字母个数
    if(*word<65 || *word>90)
    {
        flag=1;//首字母小写
    }
    for(int i=0; i<len; i++)
    {
        if(*(word+i)>=65 && *(word+i)<=90)
        {
            cnt++;
            if(flag)
            {
                return false;
            }
        }
        else if(!flag && (*(word+i)<65 || *(word+i)>90))
        {
            if(cnt>1)
            {
                return false;
            }
            flag=1;
        }
    }
    return true;
}