[LeetCode] 56. Merge Intervals - Java
·
알고리즘/LeetCode
https://leetcode.com/problems/merge-intervals/description/ Merge Intervals - LeetCode Merge Intervals - Given an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals that cover all the intervals in the input. Example 1: Input: intervals = [[1,3],[2 leetcode.com 문제 Given an array of intervals where intervals[..
[LeetCode] 57. Insert Interval - Java
·
알고리즘/LeetCode
https://leetcode.com/problems/insert-interval/description/ Insert Interval - LeetCode Insert Interval - You are given an array of non-overlapping intervals intervals where intervals[i] = [starti, endi] represent the start and the end of the ith interval and intervals is sorted in ascending order by starti. You are also given an interval new leetcode.com 문제 You are given an array of non-overlappi..
[LeetCode] 128. Longest Consecutive Sequence - Java
·
알고리즘/LeetCode
https://leetcode.com/problems/longest-consecutive-sequence/description/ Longest Consecutive Sequence - LeetCode Longest Consecutive Sequence - Given an unsorted array of integers nums, return the length of the longest consecutive elements sequence. You must write an algorithm that runs in O(n) time. Example 1: Input: nums = [100,4,200,1,3,2] Output: 4 Explanati leetcode.com 문제 Given an unsorted ..
[LeetCode] 200. Number of Islands - Java
·
알고리즘/LeetCode
https://leetcode.com/problems/number-of-islands/ Number of Islands - LeetCode Number of Islands - Given an m x n 2D binary grid grid which represents a map of '1's (land) and '0's (water), return the number of islands. An island is surrounded by water and is formed by connecting adjacent lands horizontally or vertically. You may ass leetcode.com 문제 Given an m x n 2D binary grid grid which repres..
[LeetCode] 133. Clone Graph - Java
·
알고리즘/LeetCode
https://leetcode.com/problems/clone-graph/description/ Clone Graph - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 문제 Given a reference of a node in a connected undirected graph. Return a deep copy (clone) of the graph. Each node in the graph contains a value (int) and a list (Li..
HYOJUN
'알고리즘/LeetCode' 카테고리의 글 목록 (10 Page)