forked from tdwojak/Python2017
44 lines
1009 B
Python
44 lines
1009 B
Python
#!/usr/bin/env python
|
|
# -*- coding: utf-8 -*-
|
|
|
|
|
|
"""
|
|
Napisz funkcję common_chars(string1, string2), która zwraca alfabetycznie
|
|
uporządkowaną listę wspólnych liter z lańcuchów string1 i string2.
|
|
Oba napisy będą składać się wyłacznie z małych liter.
|
|
"""
|
|
|
|
def common_chars(string1, string2):
|
|
|
|
string1 = set(string1.replace(" ",""))
|
|
string2 = set(string2.replace(" ",""))
|
|
|
|
common = []
|
|
for c1 in string1:
|
|
for c2 in string2:
|
|
if c1 == c2:
|
|
common.append(c1)
|
|
common.sort()
|
|
return common
|
|
|
|
|
|
|
|
|
|
|
|
# slowo = sum( c1 == c2 for c1, c2 in zip(string1, string2))
|
|
# print(slowo)
|
|
# return slowo
|
|
|
|
def tests(f):
|
|
inputs = [["this is a string", "ala ma kota"]]
|
|
outputs = [['a', 't']]
|
|
|
|
for input, output in zip(inputs, outputs):
|
|
if f(*input) != output:
|
|
return "ERROR: {}!={}".format(f(*input), output)
|
|
break
|
|
return "TESTS PASSED"
|
|
|
|
if __name__ == "__main__":
|
|
print(tests(common_chars))
|