摘要：
package LeetCode_1647 import java.util.* import kotlin.collections.HashMap /** * 1647. Minimum Deletions to Make Character Frequencies Unique * https: 阅读全文
摘要：
package LeetCode_670 /** * 670. Maximum Swap * https://leetcode.com/problems/maximum-swap/description/ * * Given a non-negative integer, you could swa 阅读全文
摘要：
package LeetCode_662 import java.util.* import kotlin.collections.ArrayList /** * 662. Maximum Width of Binary Tree * https://leetcode.com/problems/ma 阅读全文
摘要：
package LeetCode_170 import java.util.* /** * 170. Two Sum III - Data structure design * (Prime) * Design and implement a TwoSum class. It should supp 阅读全文
摘要：
package LeetCode_653 /** * 653. Two Sum IV - Input is a BST * https://leetcode.com/problems/two-sum-iv-input-is-a-bst/ * * Given the root of a Binary 阅读全文
摘要：
package LeetCode_647 /** * 647. Palindromic Substrings * https://leetcode.com/problems/palindromic-substrings/ * Given a string, your task is to count 阅读全文
摘要：
package LeetCode_642 import java.util.* import kotlin.collections.ArrayList import kotlin.collections.HashMap /** * 642. Design Search Autocomplete Sy 阅读全文
摘要：
package LeetCode_319 /** * 319. Bulb Switcher * https://leetcode.com/problems/bulb-switcher/ * * There are n bulbs that are initially off. You first t 阅读全文
摘要：
package LeetCode_1332 /** * 1332. Remove Palindromic Subsequences * https://leetcode.com/problems/remove-palindromic-subsequences/ * * Given a string 阅读全文
摘要：
package LeetCode_1460 /** * 1460. Make Two Arrays Equal by Reversing Sub-arrays * https://leetcode.com/problems/make-two-arrays-equal-by-reversing-sub 阅读全文