Keep Learning

摘要： package LeetCode_1209 import java.util.* /** * 1209. Remove All Adjacent Duplicates in String II * https://leetcode.com/problems/remove-all-adjacent-d 阅读全文

摘要： package _interview_question /** * Check if a given array contains duplicate elements within k distance from each other. * Given an unsorted array that 阅读全文

摘要： package LeetCode_279 import java.util.* import kotlin.collections.HashSet /** * 279. Perfect Squares * https://leetcode.com/problems/perfect-squares/d 阅读全文

摘要： package _interview_question import java.util.* /** * The question is to find the fewest number of operations needed to get to 1. available operations: 阅读全文

摘要： package LeetCode_494 /** * 494. Target Sum * https://leetcode.com/problems/target-sum/description/ * * You are given a list of non-negative integers, 阅读全文

摘要： package LeetCode_1009 /** * 1009. Complement of Base 10 Integer * https://leetcode.com/problems/complement-of-base-10-integer/description/ * * Every n 阅读全文

摘要： package LeetCode_476 /** * 476. Number Complement * https://leetcode.com/problems/number-complement/description/ * Given a positive integer num, outpu 阅读全文

摘要： package LeetCode_166 /** * 166. Fraction to Recurring Decimal * https://leetcode.com/problems/fraction-to-recurring-decimal/description/ * * Given two 阅读全文

摘要： package LeetCode_1490 /** * 1490. Clone N-ary Tree * (Prime) * Given a root of an N-ary tree, return a deep copy (clone) of the tree. Each node in the 阅读全文

摘要： package LeetCode_1485 /** * 1485. Clone Binary Tree With Random Pointer * (Prime) * A binary tree is given such that each node contains an additional 阅读全文