Created
November 29, 2018 07:51
-
-
Save andrewst/a95b09e1e5d62c61062e8114f60a12fb to your computer and use it in GitHub Desktop.
longestConsec
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// Последовательные строки | |
// Задан массив строк и целое число k. Задача - вернуть самую длинную строку, состоящую из k последовательных строк, взятых в массиве. | |
// Пример: | |
// Входной массив: ['zone', 'abigail', 'theta', 'form', 'libe', 'zas', 'theta', 'abigail'] | |
// Количество строк: 2 | |
// Результат: 'abigailtheta' | |
String longestConsec(Iterable<String> array, int k) { | |
return 'abigailtheta'; | |
} | |
bool hasErrors = false; | |
List<String> messages = []; | |
void main() { | |
test('basic tests', () { | |
expect(longestConsec(['zone', 'abigail', 'theta', 'form', 'libe', 'zas'], 2), equals('abigailtheta')); | |
expect(longestConsec(['ejjjjmmtthh', 'zxxuueeg', 'aanlljrrrxx', 'dqqqaaabbb', 'oocccffuucccjjjkkkjyyyeehh'], 1), equals('oocccffuucccjjjkkkjyyyeehh')); | |
expect(longestConsec([], 3), equals('')); | |
expect(longestConsec(['itvayloxrp','wkppqsztdkmvcuwvereiupccauycnjutlv','vweqilsfytihvrzlaodfixoyxvyuyvgpck'], 2), equals('wkppqsztdkmvcuwvereiupccauycnjutlvvweqilsfytihvrzlaodfixoyxvyuyvgpck')); | |
expect(longestConsec(['wlwsasphmxx','owiaxujylentrklctozmymu','wpgozvxxiu'], 2), equals('wlwsasphmxxowiaxujylentrklctozmymu')); | |
expect(longestConsec(['zone', 'abigail', 'theta', 'form', 'libe', 'zas'], -2), equals('')); | |
expect(longestConsec(['it','wkppv','ixoyx', '3452', 'zzzzzzzzzzzz'], 3), equals('ixoyx3452zzzzzzzzzzzz')); | |
expect(longestConsec(['it','wkppv','ixoyx', '3452', 'zzzzzzzzzzzz'], 6), equals('')); | |
expect(longestConsec(['it','wkppv','ixoyx', '3452', 'zzzzzzzzzzzz'], 15), equals('')); | |
expect(longestConsec(['it','wkppv','ixoyx', '3452', 'zzzzzzzzzzzz'], 0), equals('')); | |
}); | |
if(!hasErrors ){ | |
print('💪Tests are passed! \n\n'); | |
} else { | |
print('💩 Tests aren\'t passed! \n\n'); | |
} | |
print(messages.join('\n')); | |
} | |
typedef bool Checker(dynamic input); | |
Checker equals(dynamic input) { | |
return (dynamic internalInput) { | |
input.toString() == internalInput.toString() | |
? true | |
: throw AssertionError('value: $input is not equal: $internalInput'); | |
}; | |
} | |
void test(String name, Function input) { | |
try { | |
input(); | |
messages.add('✓ $name'); | |
} catch (e) { | |
hasErrors = true; | |
if (e is AssertionError) { | |
messages.add('✗ $test failed \n name: $name\n exception: ${e.message}'); | |
} | |
} | |
} | |
void expect(dynamic input, bool validator(dynamic validatorInput)) { | |
validator(input); | |
} | |
String _longestConsec(Iterable<String> array, int k) { | |
if (array.isEmpty || k < 1 || k > array.length) { | |
return ''; | |
} | |
final list = array.toList(); | |
var startIndex = -1; | |
var maxLength = 0; | |
for (var i=0; i < array.length - k + 1; i++) { | |
var currentLength = 0; | |
for (var j=0; j < k; j++) { | |
currentLength += list[i+j].length; | |
} | |
if(currentLength > maxLength) { | |
startIndex = i; | |
maxLength = currentLength; | |
} | |
} | |
return list | |
.skip(startIndex) | |
.take(k) | |
.fold('', (prev, x) => prev += x); | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment