Keep Learning

摘要： package LeetCode_559 import java.util.* /** * 559. Maximum Depth of N-ary Tree * https://leetcode.com/problems/maximum-depth-of-n-ary-tree/description 阅读全文

摘要： package LeetCode_1411 /** * 1411. Number of Ways to Paint N × 3 Grid * https://leetcode.com/problems/number-of-ways-to-paint-n-3-grid/description/ * * 阅读全文

摘要： package LeetCode_139 /** * 139. Word Break * https://leetcode.com/problems/word-break/description/ * * Example 1: Input: s = "leetcode", wordDict = [" 阅读全文

摘要： package LeetCode_140 /** * 140. Word Break II * https://leetcode.com/problems/word-break-ii/description/ * * Given a non-empty string s and a dictiona 阅读全文

摘要： package LeetCode_403 /** * 403. Frog Jump * https://leetcode.com/problems/frog-jump/description/ * * A frog is crossing a river. * The river is divide 阅读全文

摘要： package _Sort.Algorithm /** * https://www.geeksforgeeks.org/counting-sort/ * It is not a comparison based sorting. * It running time complexity is O(n 阅读全文

摘要： package LeetCode_767 import java.util.* import kotlin.collections.HashMap /** * 767. Reorganize String * https://leetcode.com/problems/reorganize-stri 阅读全文

摘要： package LeetCode_1092 import java.lang.StringBuilder /** * 1092. Shortest Common Supersequence * https://leetcode.com/problems/shortest-common-superse 阅读全文

摘要： package LeetCode_1143 /** * 1143. Longest Common Subsequence * https://leetcode.com/problems/longest-common-subsequence/description/ * * Given two str 阅读全文

摘要： package LeetCode_491 /** * 491. Increasing Subsequences * https://leetcode.com/problems/increasing-subsequences/description/ * Given an integer array, 阅读全文