题解 | #字符串合并处理#

字符串合并处理

https://www.nowcoder.com/practice/d3d8e23870584782b3dd48f26cb39c8f

def tarns(new_list):
    lis = []
    for i in range(len(new_list)):
        two_str = ['0', '0', '0', '0']
        if ord(new_str31[i]) in range(ord('A'), ord('F') + 1) or ord(new_str31[i]) in range(ord('a'), ord('f') + 1) or ord(new_str31[i]) in range(ord('0'), ord('9') + 1):  
            n = len(bin(int(new_list[i], 16))[2:])
            for k in bin(int(new_list[i], 16))[2:]:
                two_str[4 - n] = k
                n -= 1
            two_str.reverse()
            tran_str = hex(int(''.join(two_str), 2))[2:]
            lis.append(tran_str.upper())
        else:
            lis.append(new_list[i])
    new_lis = ''.join(lis)
    return new_lis


while True:
    try:
        receive_str = input().split()
        new_str1 = receive_str[0] + receive_str[1]
        new_str2 = list(new_str1)
        new_str31 = []
        new_str32 = []
        for i in range(0, len(new_str2), 2):
            new_str31.append(new_str2[i])
        new_str31 = sorted(new_str31)

        for i in range(1, len(new_str2), 2):
            new_str32.append(new_str2[i])
        new_str32 = sorted(new_str32)

        for i in range(len(new_str32)):
            new_str31.insert(2 * i + 1, new_str32[i])
        print(tarns(new_str31))
    except:
        break

全部评论

相关推荐

牛客小菜鸡66:boss里面,招人的叫老板,找工作的叫牛人
点赞 评论 收藏
分享
评论
1
收藏
分享

创作者周榜

更多
牛客网
牛客网在线编程
牛客网题解
牛客企业服务