Javascript Function to Detect Capital String

  • 时间:2020-09-07 13:13:13
  • 分类:网络文摘
  • 阅读:148 次

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

Detect Capital String using Javascript Function

One intutive way is to count the number of Captial letters in the given string. Then it is a valid capital string if: the count is zero (no captial letters), or count is equal to the length (all are captial letters), or count is one and the first character is uppercase.

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
/**
 * @param {string} word
 * @return {boolean}
 */
var detectCapitalUse = function(word) {
    const len = word.length;
    if (len === 0) return false;
    let cnt = 0;
    let first = false;
    for (let i = 0; i < len; ++ i) {
        const ch = word.charAt(i);
        if ((ch >= 'A') && (ch <= 'Z')) {
            cnt ++;
            if (i == 0) first = true;
        }
    }
    return (cnt === 0) || ((cnt === 1) && first) || (cnt === len);
};
/**
 * @param {string} word
 * @return {boolean}
 */
var detectCapitalUse = function(word) {
    const len = word.length;
    if (len === 0) return false;
    let cnt = 0;
    let first = false;
    for (let i = 0; i < len; ++ i) {
        const ch = word.charAt(i);
        if ((ch >= 'A') && (ch <= 'Z')) {
            cnt ++;
            if (i == 0) first = true;
        }
    }
    return (cnt === 0) || ((cnt === 1) && first) || (cnt === len);
};

Using RegExp to Detect Capital String

Using Regular Expression in Javascript helps to make the solution one-line and concise:

1
2
3
4
5
6
7
/**
 * @param {string} word
 * @return {boolean}
 */
var detectCapitalUse = function(word) {
    return /^([A-Z]+|[A-Z][a-z]*|[a-z]+)$/.test(word);
};
/**
 * @param {string} word
 * @return {boolean}
 */
var detectCapitalUse = function(word) {
    return /^([A-Z]+|[A-Z][a-z]*|[a-z]+)$/.test(word);
};

–EOF (The Ultimate Computing & Technology Blog) —

推荐阅读:
Algorithms to Determine Unique Number of Occurrences  The Next Permutation Algorithm in C++ (std::next_permutation)  Binary Tree Zigzag Level Order Traversal Algorithms using DFS an  Work-Life Balance Tips to Keep You Happy as a Blogger  Huffington Post Launches New Contributor System And Bloggers Are  5 Tips for a Smooth Transition When Moving Your Blog to a New Ho  Jerusalem To Host The Biggest Travel Blogging Event In The World  SQL Injection – The Old Trick that Keeps on Giving  Anti-Semitic Blogger Found Guilty Of Racial Harassment  Essential Tips for Your Travel Blog 
评论列表
添加评论