JAVA_LeetCode 1700_Number of Students Unable to Eat Lunch 풀이 class Solution { public int countStudents(int[] students, int[] sandwiches) { // 학생 : 큐(선입선출), 샌드위치 : 스택(후입선출) int len = students.length; Queue q = new LinkedList(); Stack st = new Stack(); for (int i = 0; i < len; i++) { st.push(sandwiches[len - i - 1]); q.offer(students[i]); } // 학생과 샌드위치를 비교하며 안맞는 경우 학생을 계속해서 옮긴다. int chk = 0; while (q.size() > 0 && chk < q.size()) { if (st.peek() == q.peek()) { st.pop(); q.pol...
#
JAVA
#
JAVA_LeetCode1700
#
JAVA_LeetCode1700_NumberofStudentsUnabletoEatLunch
#
JAVA_NumberofStudentsUnabletoEatLunch
#
LeetCode1700_NumberofStudentsUnabletoEatLunch
