본문 바로가기

Python41

[Leetcode 572] - Subtree of Another Tree Given the roots of two binary trees root and subRoot, return true if there is a subtree of root with the same structure and node values of subRoot and false otherwise. A subtree of a binary tree tree is a tree that consists of a node in tree and all of this node's descendants. The tree tree could also be considered as a subtree of itself. root, subRoot라는 두개의 이진 트리가 주어졌을때 root 안에 똑같은 subroot가 포함되.. 2024. 4. 9.
[Leetcode 100] - Same Tree w/ Python 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. p, q이라는 이진트리 두개가 주어졌을때 둘이 같은지 확인하는 문제 모양, 값다 같은지 확인한 후 True/False를 리턴하면 된다 https://leetcode.com/problems/same-tree/description/ Example 1: Input: p = [1,2,3], q = [1,2,3] Output: true Ex.. 2024. 4. 9.
[Leetcode 110] - Balanced Binary Tree w/ Python Given a binary tree, determine if it is height-balanced 이진 트리가 주어졌을때 균형 이진 트리인지 확인해야 되는 문제 https://leetcode.com/problems/balanced-binary-tree/description/ Example 1: Input: root = [3,9,20,null,null,15,7] Output: true Example 2: Input: root = [1,2,2,3,3,null,null,4,4] Output: false Example 3: Input: root = [] Output: true 함수 아웃풋: [ 현재까지 탐색한 부분이 균형인가 확인 , 현재까지 탐색한 길이 확인] 1. DFS를 통해 Root 노드가 None일때.. 2024. 4. 9.
[Leetcode 543] - Diameter of Binary Tree w/ Python Given the root of a binary tree, return the length of the diameter of the tree. The diameter of a binary tree is the length of the longest path between any two nodes in a tree. This path may or may not pass through the root. The length of a path between two nodes is represented by the number of edges between them. 이진 트리가 주어졌을때 노드를 통해 가장 긴 거리를 계산해야 되는 문제 루트를 꼭 통과 안해도 되는 전제하에 노드가 2개 있을시 거리는 1로 계산한.. 2024. 4. 9.
[Leetcode 104] - Maximum Depth of Binary Tree w/ Python Given the root of a binary tree, return its maximum depth. A binary tree's maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node. 이진 트리가 주어졌을때 깊이를 찾아내라는 문제 https://leetcode.com/problems/maximum-depth-of-binary-tree/description/ Example 1: Input: root = [3,9,20,null,null,15,7] Output: 3 Example 2: Input: root = [1,null,2] Output: 2 트리에서 깊이를 .. 2024. 4. 8.
[Leetcode 226] - Invert Binary Tree w/ Python Given the root of a binary tree, invert the tree, and return its root. 이진 트리의 루트가 주어졌을때 역순으로 바꿔 리턴하는 문제 https://leetcode.com/problems/invert-binary-tree/description/ Example 1: Input: root = [4,2,7,1,3,6,9] Output: [4,7,2,9,6,3,1] Example 2: Input: root = [2,1,3] Output: [2,3,1] Example 3: Input: root = [] Output: [] 재귀를 통해 쉽게 풀 수 있는 문제 1. 루트 노드의 왼쪽 오른쪽 노드를 바꾼다 2. 재귀를 통해 왼쪽 오른쪽 노드로 들어가서 반복한다 cla.. 2024. 4. 8.
[Leetcode 25] - Reverse Nodes in k-Group w/ Python Given the head of a linked list, reverse the nodes of the list k at a time, and return the modified list. k is a positive integer and is less than or equal to the length of the linked list. If the number of nodes is not a multiple of k then left-out nodes, in the end, should remain as it is. You may not alter the values in the list's nodes, only nodes themselves may be changed. 연결 리스트와 k가 주어졌을때 .. 2024. 4. 8.
[Leetcode 23] - Merge k Sorted Lists w/ Python 문제 You are given an array of k linked-lists lists, each linked-list is sorted in ascending order. Merge all the linked-lists into one sorted linked-list and return it. 오름차순으로 정렬 되어 있는 연결 리스트의 배열이 주어졌다. 오름차순으로 정렬 되어 있는 한개의 연결 리스트로 만들어라! https://leetcode.com/problems/merge-k-sorted-lists/ 예시 Example 1: Input: lists = [[1,4,5],[1,3,4],[2,6]] Output: [1,1,2,3,4,4,5,6] Explanation: The linked-lists a.. 2024. 4. 8.
[Leetcode 146] - LRU Cache w/ Python 문제 Design a data structure that follows the constraints of a Least Recently Used (LRU) cache. Implement the LRUCache class: - LRUCache(int capacity): Initialize the LRU cache with positive size capacity. - int get(int key) : Return the value of the key if the key exists, otherwise return -1. - void put(int key, int value) : Update the value of the key if the key exists. Otherwise, add the keyval.. 2024. 4. 7.
반응형

티스토리툴바