[JAVA] 알고리즘 문제풀이 입문 5-7

강의: https://inf.run/w779

자바(Java) 알고리즘 문제풀이 입문: 코딩테스트 대비 - 인프런 | 강의

 

 

 

 

5-7

import java.util.Scanner;

public class Main {

  public String solution(String m, String k){

    String answer = "NO";

    int num = 0;

    for(int i = 0; i < k.length(); i++){

      if(num == m.length()) return "YES";

      if(k.charAt(i) == m.charAt(num)) num++;

    }

    if(num == m.length())  return "YES";

    return answer;

  }

  public static void main(String[] args){

    Main t = new Main();

    Scanner in = new Scanner(System.in);

    String m = in.nextLine();

    String k = in.nextLine();

    in.close();

      System.out.print(t.solution(m, k));

  }

}

 

queue 이용

import java.util.LinkedList;

import java.util.Queue;

import java.util.Scanner;

public class Main {

  public String solution(String m, String k){

    Queue<Character> que = new LinkedList<>();

    String answer = "NO";

    for(int i = 0; i < m.length(); i++) que.offer(m.charAt(i));

    for(int i = 0; i < k.length(); i++){

      if(que.isEmpty()) return "YES";

      if(que.peek() == k.charAt(i)){

        if(que.remove() == null) return "YES";

      }

    }

    return answer;

  }

  public static void main(String[] args){

    Main t = new Main();

    Scanner in = new Scanner(System.in);

    String m = in.nextLine();

    String k = in.nextLine();

    in.close();

      System.out.print(t.solution(m, k));

  }

}