Mun: 9월 1주차 문제 풀이

09월/1주차/[LCD] Best Time to Buy and Sell Stock/Mun.java

@@ -0,0 +1,13 @@
+class Mun {
+    public int maxProfit(int[] prices) {
+        int min = Integer.MAX_VALUE;
+        int max = 0;
+
+        for (int price : prices) {
+            min = Math.min(min, price);
+            max = Math.max(max, price - min);
+        }
+
+        return max;
+    }
+}

09월/1주차/[LCD] Pascal's Triangle II/Mun.java

@@ -0,0 +1,21 @@
+class Mun {
+    public List<Integer> getRow(int rowIndex) {
+        List<List<Integer>> list = new ArrayList<>();
+        list.add(List.of(1));
+        list.add(List.of(1, 1));
+        if(rowIndex < 2) {
+            return list.get(rowIndex);
+        }
+        for(int i=2;i<=rowIndex;i++) {
+            List<Integer> before = list.get(i-1);
+            List<Integer> now = new ArrayList<>();
+            now.add(1);
+            for(int j=1;j<i;j++) {
+                now.add(before.get(j-1) + before.get(j));
+            }
+            now.add(1);
+            list.add(now);
+        }
+        return list.get(rowIndex);
+    }
+}