@@ -0,0 +1,359 @@
+package leetcode;%0A%0A/**%0A * https://leetcode.com/problems/best-time-to-buy-and-sell-stock/%0A */%0Apublic class Problem121 %7B%0A    public int maxProfit(int%5B%5D prices) %7B%0A        return 0;%0A    %7D%0A    %0A    public static void main(String%5B%5D args) %7B%0A        Problem121 prob = new Problem121();%0A        System.out.println(prob.maxProfit(new int%5B%5D%7B1, 2, 4, 2, 1, 3%7D));%0A    %7D%0A%7D%0A

Add problem 121