Skip to content

김채윤_프로그래머스_이진변환 #92

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
kimchaeyun6 wants to merge 2 commits into
base: main
Choose a base branch
from
Open

김채윤_프로그래머스_이진변환 #92

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
207a86e
김채윤_프로그래머스_이진변환
kimchaeyun6 Jun 21, 2022
10a92b2
0628김채윤 2299 백준 조짜기
kimchaeyun6 Jun 28, 2022
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
1 change: 1 addition & 0 deletions 김채윤/0621/Solution_p70129_이진변환반복하기.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,5 +1,6 @@
package vac;


public class Solution_p70129_이진변환반복하기 {

public int[] solution(String s) {
Expand Down
31 changes: 31 additions & 0 deletions 김채윤/0628/Solution_b2229_조짜기.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,31 @@
package vac;

import java.util.*;
import java.io.*;

public class Solution_b2229_조짜기 {

public static void main(String[] args) {
Scanner sc = new Scanner(System.in);

int N = sc.nextInt();
int[] arr = new int[N + 1];
int[] dp = new int[N + 1];
int RV = 0; //최적값
int MAX = 0; //가장 높은 값
dp[0] = 0; //자기자신
dp[1] = 0; //자기자신

for (int i = 1; i <= N; i++) {
arr[i] = sc.nextInt();

for (int j = i - 1; j >= 1; j--) {
MAX = Math.max(MAX, Math.abs(arr[i] - arr[j]) + dp[j - 1]);
}

dp[i] = MAX;
RV = dp[i];
}
System.out.println(RV);
}
}