zoukankan      html  css  js  c++  java
  • 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:

    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.


    解法:三种合法情况:全大写,全小写,首字母大写其余小写

    1. public class Solution {
    2. public bool DetectCapitalUse(string word) {
    3. string upCopy = word.ToUpper();
    4. string lowCopy = word.ToLower();
    5. if (word == upCopy || word == lowCopy) {
    6. return true;
    7. }
    8. string first = word.Substring(0, 1);
    9. string last = word.Substring(1, word.Length - 1);
    10. if (first.ToUpper() == first && last.ToLower() == last) {
    11. return true;
    12. }
    13. return false;
    14. }
    15. }





  • 相关阅读:
    Codeforces 543E. Listening to Music
    UOJ #138. 【UER #3】开学前的涂鸦
    bzoj 3569: DZY Loves Chinese II
    bzoj 2428: [HAOI2006]均分数据
    bzoj 4589: Hard Nim
    UOJ #119. 【UR #8】决战圆锥曲线
    spoj5973
    codeforces555E
    poj1275
    bzoj4152
  • 原文地址:https://www.cnblogs.com/xiejunzhao/p/7d2bcd56966626c522691f999d4380bd.html
Copyright © 2011-2022 走看看