[SW Expert Academy] 늘어지는 소리 만들기 (D3)

https://swexpertacademy.com/main/code/problem/problemDetail.do?problemLevel=3&contestProbId=AWRKWITqfvIDFAV8&categoryId=AWRKWITqfvIDFAV8&categoryType=CODE&problemTitle=&orderBy=PASS_RATE&selectCodeLang=ALL&select-1=3&pageSize=10&pageIndex=8

SW Expert Academy

 

import java.util.HashMap;
import java.util.LinkedList;
import java.util.Scanner;

class Solution {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int t = sc.nextInt();

		for (int tc = 1; tc <= t; tc++) {

			String str = sc.next();
			LinkedList<Character> list = new LinkedList<>();

			for (int i = 0; i < str.length(); i++) {
				list.add(str.charAt(i));
			}
			
			//System.out.println(list);

			int h = sc.nextInt();

			HashMap<Integer, Integer> map = new HashMap<>();

			for (int i = 0; i < h; i++) {
				int num = sc.nextInt();
				map.put(num, map.getOrDefault(num, 0) + 1);
			}
			
			
			//System.out.println(map);
			
			for(int i=str.length();i>=0;i--) {
				if(map.containsKey(i)) {
					int count=map.get(i);
					int num = i;
					for(int j=0;j<count;j++) {
						list.add(num++,'-');
					}
				}
			}

			System.out.print("#" + tc + " ");

			for (int i = 0; i < list.size(); i++) {
				System.out.print(list.get(i));
			}
			
			System.out.println();

		}
	}
}

 

LinkedList와 HashMap을 사용해서 풀이했다.

 

list.add를 해줄 때 num++이 아니라 num으로 해주어도 된다.

작대기를 꼭 끝에 붙여줄 필요는 없기 때문이다.

 

더 간단한 풀이

import java.util.Scanner;

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

		int t = sc.nextInt();

		for (int tc = 1; tc <= t; tc++) {
			String str = sc.next();

			String arr[] = (" " + str).split("");

			//System.out.println(Arrays.toString(arr));
			int h = sc.nextInt();

			for (int i = 0; i < h; i++) {
				int num = sc.nextInt();
				arr[num] += "-";
			}
			
			StringBuilder sb = new StringBuilder();
			
			System.out.print("#"+tc+" ");
			for(String n:arr) {
				sb.append(n);
			}
			System.out.println(sb.toString().trim());
			
		}
	}
}