BackJoon Algorithm 5430 AC (Java)

업데이트:
최대 1 분 소요

BackJoon Algorithm - Java

alt

문제

alt

풀이

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Deque;
import java.util.LinkedList;

public class Back_5430 {
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int T = Integer.parseInt(br.readLine());

        for (int i = 0; i < T; i++) {
            String str = br.readLine();
            int n = Integer.parseInt(br.readLine());

            String arrStr = br.readLine();
            Deque<Integer> deq = new LinkedList<>();
            for (String s : arrStr.substring(1, arrStr.length() - 1).split(",")) {
                if (!s.equals("")) {
                    deq.add(Integer.valueOf(s));
                }
            }
            System.out.println(ac(deq, str));
        }

    }

    private static String ac(Deque<Integer> deq, String commands) {
        boolean reverse = false;

        for (char command : commands.toCharArray()) {
            if (command == 'R') {
                // 뒤집기
                reverse = !reverse;
            } else {
                if (deq.size() == 0) {
                    return "error";
                }
                if (reverse) {
                    deq.removeLast();
                } else {
                    deq.removeFirst();
                }
            }

        }
        StringBuilder sb = new StringBuilder("[");
        while (!deq.isEmpty()) {
            sb.append(reverse ? deq.removeLast() : deq.removeFirst());
            if (deq.size() != 0) {
                sb.append(",");
            }
        }
        sb.append("]");
        return sb.toString();

    }
}



댓글남기기