3 条题解

  • 1
    @ 2025-5-16 11:54:56
    
    
    s=input()
    a=[0]*26
    for i in s:
        if "A"<=i<="Z":
            a[ord(i)-ord("A")]+=1
        elif "a"<=i<="z":
            n=ord(i)-ord("a")
            a[n]=a[n]+1
    imax=a[0]
    for i in range(1,26):
        if imax<a[i]:
            imax=a[i]
    s1="";s2=""
    for i in range(len(a)):
        if imax==a[i]:
            s1=s1+" "+chr(ord("A")+i)
        elif a[i]==0:
            s2=s2+" "+chr(ord("A")+i)
    print(s1[1:])
    print(imax)
    print(s2[1:])
    
    • 1
      @ 2023-12-28 8:15:34
      s = input()
      s = s.upper()
      dic = {}
      for i in s:
          if i == " ":
              continue
          if i in dic:
              dic[i] += 1
          else:
              dic[i] = 1
      num = list(dic.values())
      no = []
      ans = []
      for i in range(0,26):
          t = chr(ord("A")+i)
          if t not in dic:
              no.append(t)
          else:
              if dic[t] == max(num):
                  ans.append(t)
      
      print("出现次数最多的字母是: ",end = "")
      for i in ans:
          print(i,end = " ")
      print("出现次数为:",end = "")
      print(max(num))
      print("未出现的字母是:  ",end = "")
      for i in no:
          print(i,end = " ")
      
      • 0
        @ 2025-5-16 11:46:15
        s=input()
        a=[0]*26
        for i in s:
            if "A"<=i<="Z":
                a[ord(i)-ord("A")]+=1
            elif "a"<=i<="z":
                n=ord(i)-ord("a")
                a[n]=a[n]+1
        #找到出现次数最多的字母和未出现的字母
        maxn=0;maxi=0;no=[]
        for i in range(26):
            if a[i]==0:
                no.append(chr(ord("A")+i))
            elif a[i]>maxn:
                maxn=a[i]
                maxi=i
        
        for i in range(26):
            if a[i]==maxn:
                print(chr(ord("A")+i),end=' ')
        print()
        print(maxn)
        for i in no:
            print(i,end=' ')
        #Saying and doing are two different things.
        
        • 1

        【桶计数】统计出现次数最多的字母和未出现的字母

        信息

        ID
        909
        时间
        1000ms
        内存
        256MiB
        难度
        8
        标签
        (无)
        递交数
        629
        已通过
        120
        上传者