Keep Learning

摘要： package LeetCode_826 /** * 826. Most Profit Assigning Work * https://leetcode.com/problems/most-profit-assigning-work/description/ * * We have jobs: d 阅读全文

摘要： /** * Good morning! Here's your coding interview problem for today. This problem was asked by Google. Given the root of a binary tree, return a deepes 阅读全文

摘要： package LeetCode_238 /** * 238. Product of Array Except Self * https://leetcode.com/problems/product-of-array-except-self/description/ * Given an arra 阅读全文

摘要： package LeetCode_238 /** * 238. Product of Array Except Self * https://leetcode.com/problems/product-of-array-except-self/description/ * Given an arra 阅读全文

摘要： package LeetCode_567 /** * 567. Permutation in String * https://leetcode.com/problems/permutation-in-string/description/ * * Given two strings s1 and 阅读全文

摘要： package LeetCode_802 /** * 802. Find Eventual Safe States * https://leetcode.com/problems/find-eventual-safe-states/description/ * * In a directed gra 阅读全文

摘要： package LeetCode_314 import java.util.* import kotlin.collections.ArrayList import kotlin.collections.HashMap /** * 314. Binary Tree Vertical Order Tr 阅读全文

摘要： package LeetCode_986 /** * 986. Interval List Intersections * https://leetcode.com/problems/interval-list-intersections/description/ * * Given two lis 阅读全文

摘要： package LeetCode_1249 /** * 1249. Minimum Remove to Make Valid Parentheses * https://leetcode.com/problems/minimum-remove-to-make-valid-parentheses/de 阅读全文

摘要： package LeetCode_1249 /** * 1249. Minimum Remove to Make Valid Parentheses * https://leetcode.com/problems/minimum-remove-to-make-valid-parentheses/de 阅读全文