codewars1 调整句子顺序

Introduction
Your task is to sort a given string. Each word in the string will contain a single number. This number is the position the word should have in the result.

Note: Numbers can be from 1 to 9. So 1 will be the first word (not 0).

If the input string is empty, return an empty string. The words in the input String will only contain valid consecutive numbers.
Examples
“is2 Thi1s T4est 3a” --> “Thi1s is2 3a T4est”
“4of Fo1r pe6ople g3ood th5e the2” --> “Fo1r the2 g3ood 4of th5e pe6ople”
“” --> “”
Solution

#返回每个单词中所包含的数字
#word中不包含数字的时候,返回None
def extract_number(word):  
    for l in word: 
        if l.isdigit(): return int(l)
    return None
#将sentence分割为字符串序列,再按所包含数字升序排列,最后用空格连接
def order(sentence):
    return ' '.join(sorted(sentence.split(), key=extract_number))

solution

def order(s):
    z = []
    for i in range(1,10):
        for j in s.split():
            if str(i) in j:
               z.append(j)
    return " ".join(z)

solution

def order(sentence):
    def sort_key(s):
        return next(c for c in s if c.isdigit())
    return ' '.join(sorted(sentence.split(), key=sort_key))

solution

def order(sentence):
    return " ".join(sorted(sentence.split(), key=lambda x: int(filter(str.isdigit, x))))

solution

def order(words):
  return ' '.join(sorted(words.split(), key=lambda w:sorted(w)))
  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值