大家好，我是毛毛。ヾ(´∀ ˋ)ﾉ
废话不多说开始今天的解题Day~

520. Detect Capital

Question

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

Given a string word, return true if the usage of capitals in it is right.

Example

Example1

Input: word = "USA"
Output: true

Example2

Input: word = "FlaG"
Output: false

Constraints

• 1 <= word.length <= 100
• word consists of lowercase and uppercase English letters.

解题

题目

首先先简单的翻译一下题目
给一个字串，判断是不是符合题目的规则。

• 字母全大写
• 字母全小写
• 字母只有字首大写

Think

作法大致上是这样

• 先把第一位的字母抓出来判断字首是大写还小写。
• 如果是大写:
  • 代表剩下的字母必须都是大写或都是小写
  • 减少跑的回圈次数，从头跟从尾往中间判断是不是都是大写或都是小写
• 如果是小写:
  • 代表剩下的字母必须都是小写
  • 一样从头跟从尾往中间判断是不是都是小写

Code

Python

class Solution:
    def isPalindrome(self, x: int) -> bool:
        x = str(x)
        left = 0
        right = len(x)-1
        
        while left < right:
            if x[left] != x[right]:
                return False
            
            left += 1
            right -= 1
            
        return True

Result

• Python
  • 

大家明天见