@@ -0,0 +1,527 @@
+/**%0A* Given a rope with length n, how to cut the rope into m parts with length n%5B0%5D, n%5B1%5D, ..., n%5Bm-1%5D, in order to get %0A* the maximal product of n%5B0%5D*n%5B1%5D* ... *n%5Bm-1%5D? We have to cut once at least. %0A* Additionally, the length of the whole length of the rope, as well as the length of each part, are in integer value.%0A%0A* For example, if the length of the rope is 8, the maximal product of the part lengths is 18. In order to get the%0A* maximal product, the rope is cut into three parts with lengths 2, 3, and 3 respectively%0A*/%0A

Create MaximalProductwhenCuttingRope.java