[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..
[Leetcode] 1143. Longest Common Subsequence - Java
·
알고리즘/LeetCode
https://leetcode.com/problems/longest-common-subsequence/ Longest Common Subsequence - LeetCode Longest Common Subsequence - Given two strings text1 and text2, return the length of their longest common subsequence. If there is no common subsequence, return 0. A subsequence of a string is a new string generated from the original string with some chara leetcode.com 문제 Given two strings text1 and t..
[LeetCode] 213. House Robber II - Java
·
알고리즘/LeetCode
https://leetcode.com/problems/house-robber-ii/description/ 문제 You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. All houses at this place are arranged in a circle. That means the first house is the neighbor of the last one. Meanwhile, adjacent houses have a security system connected, and it will automatically contact the police ..
[LeetCode] 300. Longest Increasing Subsequence - Java
·
알고리즘/LeetCode
https://leetcode.com/problems/longest-increasing-subsequence/description/ Longest Increasing Subsequence - 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 an integer array nums, return the length of the longest strictly increasing subsequence . Example 1: Input: nums = [10..
HYOJUN
'자바' 태그의 글 목록 (10 Page)