题解 | #字符串合并处理#
字符串合并处理
https://www.nowcoder.com/practice/d3d8e23870584782b3dd48f26cb39c8f
import re strinput = input().split() str1 = strinput[0] str2 = strinput[1] string = str1 + str2 strodd = [] streven = [] stringList = [] result = [] for i in range(len(string)): if i % 2 == 0: streven.append(string[i]) else: strodd.append(string[i]) streven.sort() strodd.sort() for s in range((len(string) // 2) + 1): if s <= len(streven) - 1: stringList.append(streven[s]) if s <= len(strodd) - 1: stringList.append(strodd[s]) for n in stringList: if n in re.findall("[0-9A-Fa-f]", n): n = int(n, 16) # 十六转十进制 b = format(n, "b").rjust(4, "0")[::-1] # 十转二进制,并反转也可以用 ''.join(reversed(b)) # print(b) x = int(b, 2) x = format(x, "x").upper() result.append(x) else: result.append(n) print("".join(result))