CodeWar打怪升级－Python篇

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

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

0 ·

CC 4.0 BY-SA版权

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

本文分享了两个Python编程挑战的解决方案。第一个挑战是将字符串中的每个字符转换为括号，根据其在原始字符串中出现的次数决定使用左括号还是右括号，忽略大小写。第二个挑战是找出列表中最小的两个正整数并返回它们的和，同时对输入数据进行预处理，移除负数和非整数。

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