it have O(n*n), because sums recalculated for every element of array. and algorithm can't stop on right answer

用的stream流和过滤器以及lambda表达式

Great solution!

可以解读一下代码吗我感觉你的方案很棒！

so clever!

done

This implementation does not protect you from fat finger errors and may therefore be considered bad practice.

What parallel is here for?

Almost exact duplicate of my solution. Nice.

Like the idea of your final char

In the example test the arguments of assertArrayEquals() should be swapped: expected first, actual second.

it have O(n*n), because sums recalculated for every element of array. and algorithm can't stop on right answer

用的stream流和过滤器以及lambda表达式

Great solution!

可以解读一下代码吗我感觉你的方案很棒！

so clever!

done

This implementation does not protect you from fat finger errors and may therefore be considered bad practice.

What parallel is here for?

Almost exact duplicate of my solution. Nice.

Like the idea of your final char

In the example test the arguments of assertArrayEquals() should be swapped: expected first, actual second.