반응형 coding interview2 [LeetCode] 3. Longest Substring Without Repeating Characters Problem Given a string s, find the length of the longest substring without repeating characters. Example 1: Input: s = "abcabcbb" Output: 3 Explanation: The answer is "abc", with the length of 3. Example 2: Input: s = "bbbbb" Output: 1 Explanation: The answer is "b", with the length of 1. Example 3: Input: s = "pwwkew" Output: 3 Explanation: The answer is "wke", with the length of 3. Notice that.. 2023. 8. 1. [LeetCode] 94. Binary Tree Inorder Traversal LeetCode Problem [Problem] Given the root of a binary tree, return the inorder traversal of its nodes' values. [Example] Input: root = [1,null,2,3] | Output: [1,3,2] Input: root = [] | Output: [] Input: root = [1] | Output: [1] [Constraints] The number of nodes in the tree is in the range [0, 100]. -100 오른쪽 서브트리 순서로 탐색 Inorder traversal (중위 탐색) : 왼쪽 서브트리 -> 현재 노드 -> 오른쪽 서브트리 순서로 탐색 Postorder tra.. 2023. 7. 31. 이전 1 다음 반응형
