首页 > 学院 > 开发设计 > 正文

LeetCode 520. Detect Capital

2019-11-08 01:12:22
字体:
来源:转载
供稿:网友

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.

Example1:

Input: "USA"Output: True

Example2:

Input: "FlaG"Output: False

Note: The input will be a non-empty word consisting of uppercase and lowercase latin letters.

程序代码:

bool detectCapitalUse(char* word) { char *p= word; int flag = 0; if(word[0]>='a'&&word[0]<='z') flag = 0; else if(word[0]>='A'&&word[0]<='Z') flag = 1; p++; int status = -1; while(*p!='/0') { if(*p>='A'&&*p<='Z') { if(status!=0) status = 1; else return 0; } else if(*p>='a'&&*p<='z') { if(status != 1) status = 0; else return 0; } p++; } if(flag==0&&status==1) return 0; else return 1;}
发表评论 共有条评论
用户名: 密码:
验证码: 匿名发表