[BOJ] 2841. 외계인의 기타 연주(Stack).java
#. Problemhttps://www.acmicpc.net/problem/2841* The copyright in this matter is in BOJ #. Resolution Process 1. Read and understand problem 2. Redefine the problem + abstract 3. Create solution plan (select Algorithm, Data structure) 4. Prove the plan (check performance time and usage memory) 5. Carry out the plan 6. Look back on the plan and find a way to improve it #. Solve 외계인 친구와 친해지고 싶어서 이 ..
[BOJ] 2812.크게 만들기(Stack).java
#. Problemhttps://www.acmicpc.net/problem/2812* The copyright in this matter is in BOJ #. Resolution Process 1. Read and understand problem 2. Redefine the problem + abstract 3. Create solution plan (select Algorithm, Data structure) 4. Prove the plan (check performance time and usage memory) 5. Carry out the plan 6. Look back on the plan and find a way to improve it #. Solve 문제가 짧아서 금방 풀 수 있을 줄..
[BOJ] 2493.탑(stack).java
#. Problem www.acmicpc.net/problem/2493 * The copyright in this matter is in BOJ #. Resolution Process Read and understand problem Redefine the problem + abstract Create solution plan (select Algorithm, Data structure) Prove the plan (check performance time and usage memory) Carry out the plan Look back on the plan and find a way to improve it #. Solve 스택 자료구조를 활용해서 어떻게 문제를 해결할지가 포인트이다. 앞에서부터 타워..
[BOJ] 6198.옥상 정원 구미기(stack).java
#. Problemhttps://www.acmicpc.net/problem/6198* The copyright in this matter is in BOJ #. Resolution Process 1. Read and understand problem 2. Redefine the problem + abstract 3. Create solution plan (select Algorithm, Data structure) 4. Prove the plan (check performance time and usage memory) 5. Carry out the plan 6. Look back on the plan and find a way to improve it #. Solve N의 범위가 1 ≤ N ≤ 80,0..
#. Problemhttps://www.acmicpc.net/problem/1874* The copyright in this matter is in BOJ #. Resolution Process 1. Read and understand problem 2. Redefine the problem + abstract 3. Create solution plan (select Algorithm, Data structure) 4. Prove the plan (check performance time and usage memory) 5. Carry out the plan 6. Look back on the plan and find a way to improve it #. Solve stack에 열심히 push 해주다..
#. Problemhttps://www.inflearn.com/course/%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98* The copyright in this matter is in Inflearn #. Resolution Process 1. Read and understand problem 2. Redefine the problem + abstract - B도시로 1,2,3 순으로 도착 - 모든 기차는 교차로에 들어가야만 B도시로 갈 수 있음 - 도착 불가능하면 impossile 출력 3. Create solution plan (select Algorithm, Data structure) 4. Prove the plan (check performance time and usage..
#. Problemhttps://www.inflearn.com/course/%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98* The copyright in this matter is in Inflearn #. Resolution Process 1. Read and understand problem 2. Redefine the problem + abstract 3. Create solution plan (select Algorithm, Data structure) 4. Prove the plan (check performance time and usage memory) 5. Carry out the plan 6. Look back on the plan and find a way to im..
#. Problemhttps://www.inflearn.com/course/%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98* The copyright in this matter is in Inflearn #. Resolution Process 1. Read and understand problem 2. Redefine the problem + abstract - 10진수 N이 입력되면, K 진수루 변환하여 출력 3. Create solution plan (select Algorithm, Data structure) 4. Prove the plan (check performance time and usage memory) 5. Carry out the plan 6. Look back on..