Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
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
25 changes: 25 additions & 0 deletions jinny-l/season2/_230825/PGS_두_개_뽑아서_더하기.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,25 @@
package season2._230825;

import java.util.Arrays;
import java.util.Set;
import java.util.TreeSet;

public class PGS_두_개_뽑아서_더하기 {

public static void main(String[] args) {
System.out.println(Arrays.toString(solution(new int[]{5,0,2,7})));
}

public static int[] solution(int[] numbers) {
Set<Integer> answer = new TreeSet<>();

for (int i = 0; i < numbers.length; i++) {
for (int j = i + 1; j < numbers.length; j++) {
answer.add(numbers[i] + numbers[j]);
}
}

return answer.stream().mapToInt(Integer::intValue).toArray();
}

}
57 changes: 57 additions & 0 deletions jinny-l/season2/_230825/PGS_문자열_압축.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,57 @@
package season2._230825;

public class PGS_문자열_압축 {

public static void main(String[] args) {
System.out.println(solution("a" ));
}

public static int solution(String s) {
int min = Integer.MAX_VALUE;
int count = 0;
String prev = "";
String tmp = "";
StringBuilder sb = new StringBuilder();

for (int i = 1; i <= s.length() / 2; i++) {
for (int j = 0; j < s.length(); j += i) {

if ((j + i) > s.length()) { // 남은 문자열이 자르는 길이보다 짧을 때 처리
tmp = s.substring(j);
} else {
tmp = s.substring(j, j + i);
}

if (!tmp.equals(prev)) { // 앞에 문자열이 다르면
if (count == 1 || prev.equals("")) { // 개수가 1이면 문자열만 붙이고
sb.append(prev);
} else {
sb.append(count).append(prev); // 아니면 숫자와 문자열 붙인다.
}
prev = tmp;
count = 0;
}
count++;
}

// 문자열 비어있는지 확인
if (!prev.equals("")) {
if (count == 1) { // 개수가 1이면 문자열만 붙이고
sb.append(prev);
} else {
sb.append(count).append(prev); // 아니면 숫자와 문자열 붙인다.
}
prev = "";
count = 0;
}

min = Math.min(min, sb.length());
sb = new StringBuilder();
}
if (s.length() == 1) {
return 1;
}
return min;
}

}