mirror of
https://github.com/donnemartin/interactive-coding-challenges
synced 2026-01-08 10:28:03 +00:00
Add two more test cases for string compress coding challenge. (#125)
* Add two more test cases for string compress coding challenge. I believe that the existing test cases are not strict enough to assure a proper solution for this challenge. I was able to implement a wrong, but still passing solution to this basing on set and collections.Counter mechanism, since the test cases present only situations with singular occurrences of a letter chain and all the test strings are alphabetically sorted. I believe that the two new test cases enforce more thorough approach to the problem and, in effect, the test cases are more descriptive. * Fix the results in tests since the solution changed in the meantine on original branch. * Update also the test_compress and solution.
This commit is contained in:
committed by
Donne Martin
parent
9636459124
commit
a88f0a0b0b
@@ -8,6 +8,8 @@ class TestCompress(object):
|
||||
assert_equal(func(''), '')
|
||||
assert_equal(func('AABBCC'), 'AABBCC')
|
||||
assert_equal(func('AAABCCDDDDE'), 'A3BC2D4E')
|
||||
assert_equal(func('BAAACCDDDD'), 'BA3C2D4')
|
||||
assert_equal(func('AAABAACCDDDD'), 'A3BA2C2D4')
|
||||
print('Success: test_compress')
|
||||
|
||||
|
||||
|
||||
Reference in New Issue
Block a user