2024.05.24 ( Java )

1. 카드 1

Queue ( https://www.acmicpc.net/status?user_id=hcghcg17&problem_id=2161&from_mine=1 )

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

package problem_solving.queue;

import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;

public class BaekJoon_2161 {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		Queue<Integer> q = new LinkedList<Integer>();


		int n = Integer.parseInt(sc.next());
		for(int i= 1 ; i <= n ; i ++) {
			q.offer(i);
		}

		int i = 1 ;
		while(q.size()!=1) {
			System.out.print(q.poll()+ " ");
			int num = q.poll();
			q.add(num);
			
		}


		System.out.println(q.peek());

	}

}

2. 회사에 있는 사람

Hash ( https://www.acmicpc.net/problem/7785 )

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

package problem_solving.hash;

import java.util.ArrayList;
import java.util.Collections;
import java.util.HashMap;
import java.util.Scanner;

public class BaekJoon_7785 {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = Integer.parseInt(sc.next());
		HashMap<String,String> hm = new HashMap<>();
		
		for(int i= 0 ; i< n ; i++) {
			String name = sc.next();
			String state = sc.next();
			hm.put(name, state);
		}
		
		ArrayList<String> list = new ArrayList();
		
		for(String name : hm.keySet()) {
			String state = hm.get(name);
			if( state.equals("enter")) {
				list.add(name);
			}
		}
		
		list.sort(Collections.reverseOrder());
		
		for(int i= 0 ; i < list.size();i++) {
			System.out.println(list.get(i));
		}
		
		
		
	}

}

백준 레벨 변동

• Gold 5 14% -> Gold 5 16%

풀이 유형

• Queue - 1문제
• Hash - 1문제