[02주차 정지원] 타겟 넘버

.gitignore

@@ -1,6 +1,7 @@
 /**/*
 !/**/*.py
 !/**/*.java
+!/**/*.js
 !/**/*.c
 !/**/*.cpp
 !/**/*.yml

02주차/정지원/sol.py

@@ -0,0 +1,13 @@
+def solution(numbers, target):
+    idx = 0
+    current = 0
+
+    def dfs(list_of_nums, target_num, current_num, current_idx):
+        if current_idx == len(list_of_nums):
+            return 1 if current_num == target_num else 0
+
+        # 현재 상황에서 숫자를 빼거나 더하여 재귀함수 호출
+        return dfs(list_of_nums, target_num, current_num + list_of_nums[current_idx], current_idx + 1) + dfs(list_of_nums, target_num, current_num - list_of_nums[current_idx], current_idx + 1)
+
+    result = dfs(numbers, target, current, idx)
+    return result

03주차/정지원/solution.js

@@ -0,0 +1,10 @@
+function solution(sizes) {
+  let maxW = 0;
+  let maxH = 0;
+  sizes.forEach((element) => {
+      element.sort((a, b) => a - b);
+      if (element[0] > maxW) maxW = element[0];
+      if (element[1] > maxH) maxH = element[1];
+  });
+  return maxW * maxH;
+}

04주차/정지원/solution.py

@@ -0,0 +1,10 @@
+def solution(triangle):
+  for i in range(1, len(triangle)):
+    for j in range(i + 1):
+      if j == 0:
+        triangle[i][j] += triangle[i - 1][j]
+      elif j == i:
+        triangle[i][j] += triangle[i - 1][j - 1]
+      else:
+        triangle[i][j] += max(triangle[i - 1][j], triangle[i - 1][j - 1])
+  return max(triangle[-1])