|
|
вернуться в форумMessages should not contain correct solutions. i use 2 TreeSet<Integer>, nope, ok nope is prepopulated with 2, ok is prepopulated with 10 in cycle i read counts into one of them with checking if other one does not contain new value has been read recently if nope.last()>=ok.first() then the result is ok.first() nope.last>=ok.first ("g" instead of "ge" because they are never equal) |
|
|