CodeWar打怪升级－Python篇

最新推荐文章于 2022-08-29 14:57:25 发布

转载最新推荐文章于 2022-08-29 14:57:25 发布 · 735 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/skyEva/p/11008185.html

本文介绍了一个Python编程练习题，涉及将字符串转换为新字符串，新字符串中每个字符仅出现一次时用'('表示，多次出现时用')'表示。此外，还讲解了如何找到并求和两个最小的数字。文章包括大小写转换、循环、replace函数等关键步骤。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

CodeWar打怪升级－Python篇

1. The goal of this exercise is to convert a string to a new string where each character in the new string is "(" if that character appears only once in the original string, or ")" if that character appears more than once in the original string. Ignore capitalization when determining if a character is a duplicate.

Examples

"din"      =>  "((("
"recede"   =>  "()()()"
"Success"  =>  ")())())"
"(( @"     =>  "))(("

My answer

大小写转换函数、for循环、replace函数

def duplicate_encode(word):
    
    count={}
    for i in word.lower():
        if i not in count:
            count[i]=1
        else:
            count[i]+=1
    
    new_word=word.lower()
    for i in new_word:
        if count[i]>1:
            new_word=new_word.replace(i,')')
        else:
            new_word=new_word.replace(i,'(')
    return new_word

def sum_two_smallest_numbers(numbers):
    for i in range(0,len(numbers)-1):
        if (not isinstance(numbers[i],int)) or numbers[i]<0:
            numbers.remove(numbers[i])
    new_num=numbers.sort()
    sum=0
    sum=sum+int(new_num[0])+int(new_num[1])
    return sum