refactor 123

fishercoder1534 · fishercoder1534 · commit 2099dbdfed6f · 2020-05-13T13:18:26.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_123.java b/src/main/java/com/fishercoder/solutions/_123.java
@@ -1,15 +1,5 @@
 package com.fishercoder.solutions;
 
-/**
- * 123. Best Time to Buy and Sell Stock III
- *
- * Say you have an array for which the ith element is the price of a given stock on day i.
- * Design an algorithm to find the maximum profit. You may complete at most two transactions.
-
-Note:
-You may not engage in multiple transactions at the same time (ie, you must sell the stock before you buy again).
- */
-
 public class _123 {
 
     public static class Solution1 {
