leetcode 520. Detect Capital

来源:互联网 发布:pc端微信多开软件 编辑:程序博客网 时间:2024/06/06 00:40

原题:

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:

  1. All letters in this word are capitals, like "USA".
  2. All letters in this word are not capitals, like "leetcode".
  3. 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.

bool detectCapitalUse(char* word) {    int len=strlen(word);    int flag=0;    for(int n=0;n<len;n++)    {        if(*(word+n)>='A'&&*(word+n)<='Z')        {            flag++;        }    }    if(flag==len||flag==0||(flag==1&&*(word)>='A'&&*(word)<='Z'))        return true;    return false;}
感觉没啥好说的,就是用一个flag算下有几个大写字母就好。