Python: 每日一题 34

萧丹夜 · 发表于 2018-5-26 22:33:03

本帖最后由萧丹夜于 2018-5-26 22:42 编辑

貌似已经出来了

## 代码
import test
def longest_consec(x,k):
result = ''
y = []
z = []
n = len(x)
if n == 0 or n < k or k <= 0:
return ""
else:
for i in range(n):
y.append(len(x[i]))
i = 0
while i < k:
sub = y.index(max(y))
if x[sub] not in z:
# print(x[sub],end = '')
result += x[sub]
z.append(x[sub])
y[sub] = 0
i += 1
else:
y[sub] = 0
return result
#### 测试
test.assert_equals(longest_consec(["zone", "abigail", "theta", "form", "libe", "zas"], 2), "abigailtheta")
test.assert_equals(longest_consec(["ejjjjmmtthh", "zxxuueeg", "aanlljrrrxx", "dqqqaaabbb", "oocccffuucccjjjkkkjyyyeehh"], 1), "oocccffuucccjjjkkkjyyyeehh")
test.assert_equals(longest_consec([], 3), "")
test.assert_equals(longest_consec(["itvayloxrp","wkppqsztdkmvcuwvereiupccauycnjutlv","vweqilsfytihvrzlaodfixoyxvyuyvgpck"], 2), "wkppqsztdkmvcuwvereiupccauycnjutlvvweqilsfytihvrzlaodfixoyxvyuyvgpck")
test.assert_equals(longest_consec(["wlwsasphmxx","owiaxujylentrklctozmymu","wpgozvxxiu"], 2), "wlwsasphmxxowiaxujylentrklctozmymu")
test.assert_equals(longest_consec(["zone", "abigail", "theta", "form", "libe", "zas"], -2), "")
test.assert_equals(longest_consec(["it","wkppv","ixoyx", "3452", "zzzzzzzzzzzz"], 3), "ixoyx3452zzzzzzzzzzzz")
test.assert_equals(longest_consec(["it","wkppv","ixoyx", "3452", "zzzzzzzzzzzz"], 15), "")
test.assert_equals(longest_consec(["it","wkppv","ixoyx", "3452", "zzzzzzzzzzzz"], 0), "")
## 结果
Success！
Success！
Success！
Success！
Fail!owiaxujylentrklctozmymuwlwsasphmxx not equals wlwsasphmxxowiaxujylentrklctozmymu
Success！
Fail!zzzzzzzzzzzzwkppvixoyx not equals ixoyx3452zzzzzzzzzzzz
Success！
Success！

复制代码

账号		自动登录	找回密码
密码			立即注册

[技术交流] Python: 每日一题 34

浏览过的版块