给定 n 个字符串,请对 n 个字符串按照字典序排列。
数据范围: ,字符串长度满足
输入第一行为一个正整数n(1≤n≤1000),下面n行为n个字符串(字符串长度≤100),字符串中只含有大小写字母。
数据输出n行,输出结果为按照字典序排列的字符串。
9 cap to cat card two too up boat boot
boat boot cap card cat to too two up
[print(i) for i in sorted([input() for i in range(eval(input()))])]
while 1: try: a=int(input()) lst=[] while int(a)>0: lst.append(input()) a-=1 lst.sort() for i in lst: print(i) except: break
lists = [] def cmp(s1, s2): l = len(s2) if s1 == s2: return True for i, c1 in enumerate(s1): if i >= l: return 1 c2 = s2[i] if c1 != c2: return ord(c1) - ord(c2) return len(s1) - len(s2) def fun2(s1, s2): l = len(s2) if s1 == s2: return True for i, c1 in enumerate(s1): if i >= l: return False c2 = s2[i] if c1 > c2: return False elif c1 < c2: return True return False def quick_sort(i, j): if i >= j: return lists low, high = i, j p = lists[i] while i<j: while i < j and cmp(lists[j], p) >= 0: j -= 1 lists[i] = lists[j] while i < j and cmp(lists[i], p) <= 0: i += 1 lists[j] = lists[i] lists[i] = p quick_sort(low, i-1) quick_sort(i+1, high) while True: try: n = int(input()) lists = [] for i in range(n): lists.append(input()) quick_sort(0, len(lists) - 1) for s in lists: print(s) except EOFError: break
temp_list = [] while True: try: num = int(input()) if 1 <= num and num <= 1000: for i in range(num): str_in = input() if len(str_in) <= 101: #为什么101可以通过100过不了 temp_list.append(str_in) else:pass temp_list.sort() for i in temp_list: print(i) else: pass except EOFError: break是有一组测试里有一个超过100的字符串输入吗?
def istrcmp(a,b): for i in range(0,max(len(a),len(b))): if i>=len(a): return -1 if i>=len(b): return 1 if ord(a[i]) != ord(b[i]): return 1 if ord(a[i]) > ord(b[i]) else -1 return 0 n = int(input()) d = [] for i in range(0,n): d.append(input()) for i in range(0,n): for j in range(i,n): if istrcmp(d[i],d[j])==1: t = d[i] d[i] = d[j] d[j] = t for i in range(0,n): print(d[i])