코딩테스트를 준비하면서 필요한 정보들을 저장

배열

Stack 자료구조

• isFull(), isEmpty(), peek(), push(), pop();
• stack.size();
• ArrayDeque<Character> stack = new ArrayDeque<>();
• Stack<Integer>[] lanes = new Stack[length];
• String s ⇒ char[] a = s.toCharArray();

Queue 자료구조

• isFull(), isEmpty(), add(), poll();
• int front, int rear, data[maxsize];
• Queue<Integer> queue = new ArrayDeque<>();
• ArrayDeque<String> cardsDeque = new ArrayDeque<>(Arrays.asList(cards));
  • cards = [”i”, “drink”, “water”];
  • cardsDeque.peekFirst(), goalDeque.pollFirst();

HashMap 자료구조

• put(key, value), get(key), remove(key), containsKey(key);
• clear(), isEmpty(), size();
• HashMap<Character, Character> map = new HashMap<>(); ← map.put(’)’, ‘(’);
• 키가 없다면 - !map.containsKey(c);