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
//Дана строка, содержащая буквы и числа (без знаков препиная, пробелов и пр, например 1323dart23123dart). | |
//Необходимо подсчитать количество вхождений каждого слова вне зависимости от регистра (используйте нижний регистр для возвращаемого значения, например {dart:2}) | |
Map<String, int> calculateWordsCount(String str){ | |
var tokens = str.split(new RegExp(r'[0-9]')).where((t)=>t!=''); | |
var map = new Map<String, int>(); | |
for(var token in tokens){ | |
token = token.toLowerCase(); | |
if(!map.containsKey(token)){ | |
map[token]=0; | |
} |
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
List<int> removeSmallest(List<int> input){ | |
if(input == null || input.length==0){ | |
return input; | |
} | |
var minIndex = 0; | |
var min = input[0]; | |
for(var i=1;i<input.length;i++){ | |
var item = input[i]; |