Create ContainerWithMostWater.java

this code can solve the problem in O(n) complexity, it is quite like two sum problem. The key point is to notice: if right side is lower than left side, then move left side will lead to less capacity, and the opposite is true. Thus, we can just scan from two sides and determine which has larger capacity.