Keep Learning

摘要： package LeetCode_216 /** * 216. Combination Sum III * https://leetcode.com/problems/combination-sum-iii/description/ * * Find all possible combination 阅读全文

摘要： package LeetCode_39 /** * 39. Combination Sum * https://leetcode.com/problems/combination-sum/description/ * * Given a set of candidate numbers (candi 阅读全文

摘要： package LeetCode_496 import java.util.* import kotlin.collections.HashMap /** * 496. Next Greater Element I * https://leetcode.com/problems/next-great 阅读全文

摘要： package LeetCode_226 import java.util.* /** * 226. Invert Binary Tree * https://leetcode.com/problems/invert-binary-tree/description/ * * Invert a bin 阅读全文

摘要： package LeetCode_532 /** * 532. K-diff Pairs in an Array * https://leetcode.com/problems/k-diff-pairs-in-an-array/description/ * * Given an array of i 阅读全文

摘要： package _interview_question /** * https://leetcode.com/discuss/interview-question/275785/facebook-phone-screen-count-subsets * * Input: Given an array 阅读全文

摘要： dp是什么? dp是一种编程方法；将一个问题拆成几个子问题，分别求解这些子问题，即可推断出大问题的解。 无后效性 "未来与过去无关"，这就是无后效性。如果给定某一阶段的状态，则在这一阶段以后过程的发展不受这阶段以前各段状态的影响； 有重复的子问题 子问题会被求解多次； 最优子结构 大问题的最优解可以 阅读全文

摘要： package LeetCode_236 /** * 236. Lowest Common Ancestor of a Binary Tree * https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/descri 阅读全文

摘要： package LeetCode_725 /** * 725. Split Linked List in Parts * https://leetcode.com/problems/split-linked-list-in-parts/description/ * * Given a (singly 阅读全文

摘要： package LeetCode_23 import java.util.* /** * 23. Merge k Sorted Lists * https://leetcode.com/problems/merge-k-sorted-lists/description/ * * Merge k so 阅读全文