[LeetCode] 143. Reorder List - Java
·
알고리즘/LeetCode
https://leetcode.com/problems/reorder-list/ Reorder List - LeetCode Reorder List - You are given the head of a singly linked-list. The list can be represented as: L0 → L1 → … → Ln - 1 → Ln Reorder the list to be on the following form: L0 → Ln → L1 → Ln - 1 → L2 → Ln - 2 → … You may not modify the va leetcode.com 문제 You are given the head of a singly linked-list. The list can be represented as: L..
[LeetCode] 23. Merge k Sorted Lists - Java
·
알고리즘/LeetCode
https://leetcode.com/problems/merge-k-sorted-lists/description/ Merge k Sorted Lists - LeetCode Merge k Sorted Lists - 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. Example 1: Input: lists = [[1,4,5],[1,3,4],[2,6]] Output: [1,1,2, leetcode.com 문제 You are given an array of k link..
[LeetCode] 3. Longest Substring Without Repeating Characters - Java
·
알고리즘/LeetCode
https://leetcode.com/problems/longest-substring-without-repeating-characters/description/ Longest Substring Without Repeating Characters - LeetCode Longest Substring Without Repeating Characters - 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: In..
[LeetCode] 102. Binary Tree Level Order Traversal - Java
·
알고리즘/LeetCode
https://leetcode.com/problems/binary-tree-level-order-traversal/ Binary Tree Level Order Traversal - LeetCode Binary Tree Level Order Traversal - Given the root of a binary tree, return the level order traversal of its nodes' values. (i.e., from left to right, level by level). Example 1: [https://assets.leetcode.com/uploads/2021/02/19/tree1.jpg] Input: root = [ leetcode.com 문제 Given the root of ..
[LeetCode] 572. Subtree of Another Tree - Java
·
알고리즘/LeetCode
https://leetcode.com/problems/subtree-of-another-tree/description/ Subtree of Another Tree - LeetCode 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 n leetcode.com 문제 Given the roots of two ..
HYOJUN
'Java' 태그의 글 목록 (9 Page)