【每日一题0910】打字员

:woman_mage:John是一名打字员,他有一个习惯就是切换大小写时从来不按SHIFT键,而是只用Caps Lock键。老板为了监督John的工作,想统计John每天敲了多少次键盘,让我们编写一个函数来实现这个想法吧。

备注:输入的是字符串,只包含大小写英文字母。键盘初始默认是小写状态。

示例:
输入:aa,返回2,因为敲了a, a
输入:Aa,返回4,因为敲了Cpas Lock, A, Cpas Lock, a

题目难度:简单
题目来源:codewars

def typist(words: str) -> int:
    pass

assert typist("aA") == 3
assert typist("Aa") == 4
assert typist("AAAaaaBBBbbbABAB") == 21
import string
def typist(words):
    tag=0
    num=len(words)
    if words[0] in string.ascii_uppercase:
        num=num+1
        tag=0
    else:
        tag=1
    for i in range(1,len(words)):
        if words[i] in string.ascii_lowercase and tag==0:
            tag=1
            num=num+1
        if words[i] in string.ascii_uppercase and tag==1:
            tag=0
            num=num+1
    print(num)
    return num
public Integer typist(String words) {
        int res = 1;
        char[] chars = words.toCharArray();
        if (Character.isUpperCase(chars[0])) {
            res = 2;
        }
        for (int i = 1; i < chars.length; i++) {
            if ((Character.isUpperCase(chars[i - 1]) && Character.isUpperCase(chars[i])) || (Character.isLowerCase(chars[i - 1]) && Character.isLowerCase(chars[i]))) {
                res++;
            } else {
                res += 2;
            }
        }
        return res;
    }

    @Test
    public void testTypist() {
        assert typist("aA").equals(3);
        assert typist("Aa").equals(4);
        assert typist("AAAaaaBBBbbbABAB").equals(21);
    }
    public static int typist(String str){
        int count=0;
        char[] chars = str.toCharArray();
        for(int i=0;i<chars.length;i++){
            if(
                    (i==0&&Character.isUpperCase(chars[i]))||
                    (i>0&&Character.isUpperCase(chars[i])&&(!Character.isUpperCase(chars[i-1])))||
                    (i>0&&(!Character.isUpperCase(chars[i]))&&Character.isUpperCase(chars[i-1]))
            ){
                count++;
            }
        }
        return str.length()+count;
    }
def typist(words: str) -> int:
    count = len(words)
    if words[0].isupper() == True:
        count += 1
    for i in range(len(words)-1):
        if words[i].isupper() != words[i+1].isupper():
            count += 1
    return count
1 个赞
def typist(words: str) -> int:
    # 键盘初始默认是小写状态,Cpas Lock灯关闭
    Cpas_Lock = False
    # 计数器初始化为0
    count = 0
    # 遍历每个字母
    for s in words:
        # 获取单个字母的 ASCII码
        strCode = ord(s)
        # 判断字母是大写还是小写
        # 大写字母ASCII码范围:65~90
        # 小写字母ASCII码范围:97~122
        strStatu = "大写字母" if strCode < 97 else "小写字母"
        if Cpas_Lock == False and strStatu == "大写字母":
            # 如果 Cpas Lock灯熄灭的,且敲出的是大写字母
            # 那么必需按 Cpas Lock建,将键盘大写打开才能敲出来
            Cpas_Lock = True
            # 计数器 +1
            count += 1
        elif Cpas_Lock == True and strStatu == "小写字母" :
            # 如果 Cpas Lock灯亮着,且敲出的是小写字母
            # 那么必需按 Cpas Lock建,将键盘大写关闭才能敲出来
            Cpas_Lock = False
            # 计数器 +1
            count += 1
        # 敲出字母本身,计数器 +1
        count += 1
    # 返回计数器的值
    return count

assert typist("aA") == 3
assert typist("Aa") == 4
assert typist("AAAaaaBBBbbbABAB") == 21
def typist(words: str) -> int:
  result = 0
  caps_lock = False
  for word in words:
    if (word.isupper() and not caps_lock) or (not word.isupper() and caps_lock):
      result += 1
      caps_lock = not caps_lock
    result += 1

  return result

assert typist("aA") == 3
assert typist("Aa") == 4
assert typist("AAAaaaBBBbbbABAB") == 21
def typist(words: str) -> int:
    words = list(words)
    count=[]
    for i in range(1,len(words)):
        if (words[i].isupper() and words[i - 1].isupper()) or (words[i].islower() and words[i - 1].islower()):
            count.append(1)
        else:
            count.append(2)
    return sum(count)+1 if words[0].islower() else sum(count)+2

assert typist("aA") == 3
assert typist("Aa") == 4
assert typist("AAAaaaBBBbbbABAB") == 21
def typist(words: str) -> int:
    sum = 0
    for i in range(len(words)):
        # 如果第i位是小写字母
        # 如果第i-1位是小写字母或者第i位是第一位,键盘次数+1
        # 否则第i-1位是大写字母,键盘次数+2
        if words[i].islower():
            if words[i - 1].islower() or i == 0:
                sum += 1
            else:
                sum += 2
        # 如果第i位是大写字母
        # 如果第i-1位是小写字母或者第i位是第一位,键盘次数+2
        # 否则第i-1位是大写字母,键盘次数+1
        else:
            if words[i - 1].islower() or i == 0:
                sum += 2
            else:
                sum += 1
    return sum
def typist(words: str) -> int:
    l = [str(int(w == w.upper())) for w in words]
    upper_areas = len([i for i in str("".join(l)).split('0') if i!=""])
    return upper_areas*2 + len(words) - (1 if l[len(l)-1]=='1' else 0)