2024.05.27 ( Java )

1. A와B

Greedy ( https://www.acmicpc.net/problem/12904 )

GitHub -> https://github.com/changi123/Algorithm-And-Data_structure/blob/main/Algorithm/src/problem_solving/greedy/BaekJoon_12904.java

package problem_solving.greedy;

import java.util.Arrays;
import java.util.Scanner;

public class BaekJoon_12904 {
	
	static StringBuilder sb = new StringBuilder();
	static StringBuilder makeSb = new StringBuilder();

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		sb.append(sc.next());
		makeSb.append(sc.next());
		while(makeSb.length()>=sb.length()) {
			
			if( makeSb.toString().equals(sb.toString())) {
				System.out.println(1);
				return ;
				
			}
			
			if( makeSb.charAt(makeSb.length()-1) == 'A') {
				makeSb.deleteCharAt(makeSb.length()-1);
				continue;
			} else if(makeSb.charAt(makeSb.length()-1) == 'B' ) {
				makeSb.deleteCharAt(makeSb.length()-1);
				makeSb.reverse();
				continue;
			}
			
		}
			
			
		System.out.println(0);
		
	}
	

	
}

2. 백준 레벨 변동

• Gold 5 17% -> Gold 5 22%

3. 풀이 유형

• Greedy - 1문제