[리트코드] 100. Same Tree (tree)
문제 정보 Given the roots of two binary trees p and q, write a function to check if they are the same or not. Two binary trees are considered the same if they are structurally identical, and the nodes have the same value. Example 1: Input: p = [1,2,3], q = [1,2,3] Output: true Example 2: Input: p = [1,2], q = [1,null,2] Output: false 문제 풀이 두 개의 트리를 동시에 순회하면서 다른 부분이 발견될 경우 false를 리턴한다. Writeup /** * ..
2022. 1. 27.
[리트코드] 49. Group Anagrams (HashTable)
문제 정보 Given an array of strings strs, group the anagrams together. You can return the answer in any order. An Anagram is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once. Example 1: Input: strs = ["eat","tea","tan","ate","nat","bat"] Output: [["bat"],["nat","tan"],["ate","eat","tea"]] Example 2: Input: strs = ..
2022. 1. 26.
