Merge branch 'main' of https://github.com/solid-connection/solid-connect-algorithm into whqtker

Author: whqtker

personal/JAEHEE25/Programmers/수식_최대화.java

@@ -0,0 +1,81 @@
+import java.util.*;
+class Solution {
+    public long solution(String expression) {
+        List<String> list = toList(expression); //리스트로 분리
+
+        //우선순위별 계산
+        String[] prior = {"*-+", "*+-", "+-*", "+*-", "-*+", "-+*"};
+        long answer = 0;
+        for (String p : prior) {
+            answer = Math.max(getResult(list, p), answer); //해당 우선순위로 계산했을 때의 결과로 최댓값 찾기
+        }
+        return answer;
+    }
+
+    long getResult(List<String> list, String p) {
+        Deque<String> dq = new ArrayDeque<>();
+        for (int i = 0; i < list.size(); i++) { //리스트로 덱 초기화
+            dq.offerLast(list.get(i));
+        }
+        dq.offerLast("last"); //마지막 원소임을 표시
+
+        int pi = 0;
+        char op = '.'; //.으로 초기화
+        while (pi < 3) {
+            String val = dq.pollFirst();
+
+            if (val.equals("last")) { //마지막 원소일 경우
+                pi++;
+                if (dq.size() == 1) { //1개만 남았을 경우 최종 결과 반환
+                    return Math.abs(Long.parseLong(dq.pollLast()));
+                }
+                dq.offerLast("last");
+                continue;
+            }
+
+            if (op != '.') { //계산
+                long num1 = Long.parseLong(dq.pollLast());
+                long num2 = Long.parseLong(val);
+                long result = calculate(num1, num2, op);
+                dq.offerLast(String.valueOf(result)); //연산 결과 삽입
+                op = '.';
+                continue;
+            }
+
+            if (val.charAt(0) == p.charAt(pi)) { //우선순위에 해당하는 연산자라면
+                op = val.charAt(0);
+            } else {
+                dq.offerLast(val);
+            }
+        }
+
+        return 0;
+    }
+
+    long calculate(long num1, long num2, char op) {
+        if (op == '*') {
+            return num1 * num2;
+        } else if (op == '+') {
+            return num1 + num2;
+        } else {
+            return num1 - num2;
+        }
+    }
+
+    List<String> toList(String expression) {
+        List<String> list = new ArrayList<>();
+        StringBuilder sb = new StringBuilder();
+        for (int i = 0; i < expression.length(); i++) {
+            char c = expression.charAt(i);
+            if (!Character.isDigit(c)) { //연산자라면
+                list.add(sb.toString());
+                sb = new StringBuilder();
+                list.add(String.valueOf(c));
+            } else {
+                sb.append(c);
+            }
+        }
+        list.add(sb.toString());
+        return list;
+    }
+}

weekly/week01/BOJ_1920_수 찾기/lsy1307.cpp

@@ -0,0 +1,23 @@
+#include <iostream>
+#include <unordered_set>
+using namespace std;
+
+int main() {
+    ios_base::sync_with_stdio(false);
+    cin.tie(nullptr);
+    cout.tie(nullptr);
+    int N, num1, M, num2;
+    cin >> N;
+    unordered_set<int> numbers;
+    numbers.reserve(N);
+    while (N--) {
+        cin >> num1;
+        numbers.insert(num1);
+    }
+    cin >> M;
+    while (M--) {
+        cin >> num2;
+        if (numbers.find(num2) != numbers.end()) cout << 1 << "\n";
+        else cout << 0 << "\n";
+    }
+}

weekly/week02/BOJ_15486_퇴사2/JAEHEE25.java

@@ -0,0 +1,32 @@
+package week02.BOJ_15486_퇴사2;
+
+import java.util.*;
+import java.lang.*;
+import java.io.*;
+
+class BOJ15486 {
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        int N = Integer.parseInt(br.readLine());
+        int[] T = new int[N];
+        int[] P = new int[N];
+        for (int i = 0; i < N; i++) {
+            StringTokenizer st = new StringTokenizer(br.readLine());
+            int t = Integer.parseInt(st.nextToken());
+            int p = Integer.parseInt(st.nextToken());
+            T[i] = t;
+            P[i] = p;
+        }
+
+        int max = 0;
+        int[] dp = new int[N + 1];
+        for (int i = 0; i < N; i++) {
+            max = Math.max(dp[i], max);
+            if (i + T[i] <= N) { //기간 초과 제외
+                dp[i + T[i]] = Math.max(P[i] + max, dp[i + T[i]]);
+            }
+        }
+
+        System.out.println(Math.max(dp[N], max));
+    }
+}

weekly/week02/BOJ_15486_퇴사2/gyuhyeok99.cpp

@@ -0,0 +1,31 @@
+#include <iostream>
+#include <algorithm>
+
+using namespace std;
+
+int n, ret;
+int arr[1500001][2];
+int dp[1500001];
+
+int main() {
+    ios_base::sync_with_stdio(false);
+    cin.tie(NULL);
+    cout.tie(NULL);
+
+    cin >> n;
+
+    for (int i = 0; i < n; i++) {
+        cin >> arr[i][0] >> arr[i][1];
+    }
+
+    for (int i = n - 1; i >= 0; i--) {
+        if (i + arr[i][0] <= n) {
+            dp[i] = max(dp[i + 1], arr[i][1] + dp[i + arr[i][0]]);
+        } else {
+            dp[i] = dp[i + 1];
+        }
+    }
+
+    cout << dp[0] << '\n';
+    return 0;
+}

weekly/week02/BOJ_15486_퇴사2/sukangpunch.java

@@ -0,0 +1,39 @@
+package stduy.week02;
+
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
+
+// 퇴사 2
+// 답 확인
+public class BOJ_15486 {
+
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+
+        int N = Integer.parseInt(br.readLine());
+        int[] T = new int[N + 1];
+        int[] P = new int[N + 1];
+
+        for(int i = 1; i <= N; i++){
+            String[] s = br.readLine().split(" ");
+            T[i] = Integer.parseInt(s[0]);
+            P[i] = Integer.parseInt(s[1]);
+        }
+
+        int[] dp = new int[N + 2]; // N+1일에 끝나는 상담을 위해 N+2 크기
+
+        for(int i = 1; i <= N; i++){
+            // i 일에 상담을 하지 않으면, i일의 수익이 i+1 에도 그대로 유지
+            dp[i + 1] = Math.max(dp[i + 1], dp[i]);
+
+            // i일에 상담을 하는 경우
+            int endDay = i + T[i];
+            if(endDay <= N + 1){
+                dp[endDay] = Math.max(dp[endDay], dp[i] + P[i]); // 수익이 발생하는 날에 바로 P값을 적용한 결과 저장
+            }
+        }
+
+        System.out.println(dp[N + 1]);
+    }
+}

weekly/week02/BOJ_1965_상자넣기/Hexeong.cpp

@@ -0,0 +1,35 @@
+//
+// Created by hex on 26. 1. 19..
+//
+
+#include <iostream>
+#include <vector>
+
+using namespace std;
+
+int main() {
+    ios::sync_with_stdio(false);
+    cin.tie(nullptr);
+    cout.tie(nullptr);
+
+    int n; cin >> n;
+    vector<int> arr(n);
+    vector<int> dp(n, 1);
+
+    for (int i = 0; i < n; i++)
+        cin >> arr[i];
+
+    int max_v = 1;
+    for (int i = 0; i < n; i++) {
+        for (int j = 0; j < i; j++) {
+            if (arr[j] < arr[i]) {
+                dp[i] = max(dp[i], dp[j] + 1);
+            }
+        }
+        max_v = max(max_v, dp[i]);
+    }
+
+    cout << max_v << endl;
+
+    return 0;
+}

weekly/week02/BOJ_1965_상자넣기/gyuhyeok99.cpp

@@ -0,0 +1,26 @@
+#include <iostream>
+#include <algorithm>
+
+using namespace std;
+
+int n, len, num;
+int lis[1001];
+int main() {
+    ios_base::sync_with_stdio(false);
+    cin.tie(NULL);
+    cout.tie(NULL);
+
+    cin >> n;
+
+    for (int i = 0; i < n; i++) {
+        cin >> num;
+        auto lowerPos = lower_bound(lis, lis + len, num);
+        if (*lowerPos == 0) {
+            len++;
+        }
+        *lowerPos = num;
+    }
+
+    cout << len << '\n';
+    return 0;
+}

weekly/week02/BOJ_1965_상자넣기/sukangpunch.java

@@ -0,0 +1,40 @@
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
+
+// 상자 넣기
+// 알고리즘 종류 확인
+public class BOJ_1965 {
+
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+
+        int N = Integer.parseInt(br.readLine());
+
+        int [] arr = new int[N+1];
+        String [] s = br.readLine().split(" ");
+        int [] dp = new int[N+1];
+
+        for(int i=1; i<=N; i++){
+            arr[i] = Integer.parseInt(s[i-1]);
+            dp[i] = 1;
+        }
+
+        for(int i=2; i<=N; i++){
+            for(int j=1; j<i; j++){
+                if(arr[i] > arr[j]){
+                    dp[i] = Math.max(dp[j]+1, dp[i]);
+                }
+            }
+        }
+
+        int max = 0;
+        for(int i=1; i<=N; i++){
+            if(max < dp[i]){
+                max = dp[i];
+            }
+        }
+
+        System.out.println(max);
+    }
+}

weekly/week02/PGS_줄서는방법/gyuhyeok99.cpp

@@ -0,0 +1,30 @@
+#include <string>
+#include <vector>
+using namespace std;
+
+vector<int> answer;
+vector<int> numbers;
+vector<long long> dp;
+
+vector<int> solution(int n, long long k) {
+    dp.resize(n);
+    dp[0] = 1;
+    for (int i = 1; i < n; i++) {
+        dp[i] = dp[i-1] * i;
+    }
+
+    for (int i = 1; i <= n; i++) {
+        numbers.push_back(i);
+    }
+
+    k--;
+
+    for (int i = 0; i < n; i++) {
+        long long idx = k / dp[n-1-i];
+        answer.push_back(numbers[idx]);
+        numbers.erase(numbers.begin() + idx);
+        k %= dp[n-1-i];
+    }
+
+    return answer;
+}

weekly/week03/BOJ_14503_로봇청소기/.gitkeep

@@ -0,0 +1 @@
+# 이번 주도 파이팅!🔥