#121 股票买卖(只允许交易一次求最大收益)

Author: Isaaclot

main/src/dynamic_programming/LC_121_BestTimeToBuyOrSellStock.java

@@ -0,0 +1,20 @@
+package dynamic_programming;
+
+/**
+ * @author liangqian0723@gmail.com
+ * @since 2020/3/9 10:33 AM
+ */
+public class LC_121_BestTimeToBuyOrSellStock {
+    /**
+     * 暴力遍历
+     */
+    public int maxProfit(int[] prices) {
+        int maxProfit = 0;
+        for (int i = 0; i < prices.length - 1; i++) {
+            for (int j = i + 1; j < prices.length; j++) {
+                maxProfit = Math.max(maxProfit, prices[j] - prices[i]);
+            }
+        }
+        return maxProfit;
+    }
+}

main/test/dynamic_programming/LC_121_BestTimeToBuyOrSellStockTest.java

@@ -0,0 +1,18 @@
+package dynamic_programming;
+
+import org.junit.Test;
+
+import static org.hamcrest.core.Is.is;
+import static org.junit.Assert.assertThat;
+
+/**
+ * @author liangqian0723@gmail.com
+ * @since 2020/3/9 10:28 AM
+ */
+public class LC_121_BestTimeToBuyOrSellStockTest {
+    @Test
+    public void best_time_to_buy_sell_stock_test() {
+        LC_121_BestTimeToBuyOrSellStock bt = new LC_121_BestTimeToBuyOrSellStock();
+        assertThat(bt.maxProfit(new int[]{7, 1, 5, 3, 6, 4}), is(5));
+    }
+}