07 2020 档案
摘要:package LeetCode_973 import java.util.* /** * 973. K Closest Points to Origin * https://leetcode.com/problems/k-closest-points-to-origin/description/
阅读全文
摘要:package LeetCode_917 import java.util.* /** * 917. Reverse Only Letters * https://leetcode.com/problems/reverse-only-letters/description/ * * Given a
阅读全文
摘要:package LeetCode_791 /** * 791. Custom Sort String * https://leetcode.com/problems/custom-sort-string/description/ * * S and T are strings composed of
阅读全文
摘要:package LeetCode_745 /** * 745. Prefix and Suffix Search * https://leetcode.com/problems/prefix-and-suffix-search/description/ * Given many words, wor
阅读全文
摘要:package LeetCode_729 import java.util.* /** * 729. My Calendar I * https://leetcode.com/problems/my-calendar-i/description/ * https://zxi.mytechroad.c
阅读全文
摘要:package LeetCode_729 /** * 729. My Calendar I * https://leetcode.com/problems/my-calendar-i/description/ * https://zxi.mytechroad.com/blog/algorithms/
阅读全文
摘要:package LeetCode_4 /** * 4. Median of Two Sorted Arrays * https://leetcode.com/problems/median-of-two-sorted-arrays/description/ * * There are two sor
阅读全文
摘要:package LeetCode_636 import java.util.* /** * 636. Exclusive Time of Functions * https://leetcode.com/problems/exclusive-time-of-functions/description
阅读全文
摘要:package LeetCode_477 /** * 477. Total Hamming Distance * https://leetcode.com/problems/total-hamming-distance/description/ * * The Hamming distance be
阅读全文
摘要:package LeetCode_863 import java.util.* import kotlin.collections.ArrayList import kotlin.collections.HashMap import kotlin.collections.HashSet /** *
阅读全文
摘要:package LeetCode_329 import java.util.* /** * 329. Longest Increasing Path in a Matrix * https://leetcode.com/problems/longest-increasing-path-in-a-ma
阅读全文
摘要:package LeetCode_283 /** * 283. Move Zeroes * https://leetcode.com/problems/move-zeroes/description/ * * Given an array nums, write a function to move
阅读全文
摘要:package LeetCode_452 /** * 452. Minimum Number of Arrows to Burst Balloons * https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons/
阅读全文
摘要:package LeetCode_267 import java.lang.StringBuilder /** * 267. Palindrome Permutation II * (Peime) * Given a string s, return all the palindromic perm
阅读全文
摘要:package LeetCode_266 /** * 266. Palindrome Permutation * (prime) * https://www.lintcode.com/problem/palindrome-permutation/description * *Given a stri
阅读全文
摘要:package LeetCode_301 import java.util.* import kotlin.collections.ArrayList import kotlin.collections.HashSet /** * 301. Remove Invalid Parentheses *
阅读全文
摘要:package LeetCode_460 import java.util.* import kotlin.collections.HashMap /** * 460. LFU Cache * https://leetcode.com/problems/lfu-cache/description/
阅读全文
摘要:package LeetCode_785 import java.util.* /** * 785. Is Graph Bipartite? (是否二分图) * https://leetcode.com/problems/is-graph-bipartite/description/ * * Giv
阅读全文
摘要:package LeetCode_1318 /** * 1318. Minimum Flips to Make a OR b Equal to c * https://leetcode.com/problems/minimum-flips-to-make-a-or-b-equal-to-c/desc
阅读全文
摘要:package LeetCode_211 /** * 211. Add and Search Word - Data structure design * https://leetcode.com/problems/add-and-search-word-data-structure-design/
阅读全文
摘要:package LeetCode_188 /** * 188. Best Time to Buy and Sell Stock IV * https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/description/ * *
阅读全文
摘要:package LeetCode_123 /** * 123. Best Time to Buy and Sell Stock III * https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/description/ *
阅读全文
摘要:package LeetCode_122 /** * 122. Best Time to Buy and Sell Stock II * https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/description/ * *
阅读全文
摘要:package LeetCode_121 /** * 121. Best Time to Buy and Sell Stock * https://leetcode.com/problems/best-time-to-buy-and-sell-stock/description/ * * Say y
阅读全文
摘要:package LeetCode_269 import java.lang.StringBuilder import java.util.* import kotlin.collections.HashMap import kotlin.collections.HashSet /** * 269.
阅读全文
摘要:package LeetCode_1507 import java.lang.StringBuilder /** * 1507. Reformat Date * https://leetcode.com/problems/reformat-date/description/ * * Given a
阅读全文
摘要:package LeetCode_1060 /** * 1060. Missing Element in Sorted Array * (Prime) * Given a sorted array A of unique numbers, find the K-th missing number s
阅读全文
摘要: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
阅读全文
摘要:package LeetCode_138 /** * 138. Copy List with Random Pointer * https://leetcode.com/problems/copy-list-with-random-pointer/description/ * * A linked
阅读全文
摘要:package LeetCode_380 /** * 380. Insert Delete GetRandom O(1) * https://leetcode.com/problems/insert-delete-getrandom-o1/description/ * Design a data s
阅读全文
摘要:package LeetCode_681 /** * 681. Next Closest Time * (Prime) * https://www.lintcode.com/problem/next-closest-time/description * * Given a time represen
阅读全文
摘要:package LeetCode_323 import java.util.* import kotlin.collections.ArrayList import kotlin.collections.HashMap /** * 323. Number of Connected Component
阅读全文
摘要:package LeetCode_680 /** * 680. Valid Palindrome II * https://leetcode.com/problems/delete-operation-for-two-strings/description/ * Given a non-empty
阅读全文
摘要:package LeetCode_523 /** * 523. Continuous Subarray Sum * https://leetcode.com/problems/continuous-subarray-sum/description/ * * Given a list of non-n
阅读全文
摘要:package LeetCode_901 import java.util.* /** * 901. Online Stock Span * https://leetcode.com/problems/online-stock-span/description/ * * Write a class
阅读全文
摘要:package LeetCode_547 import java.util.* /** * 547. Friend Circles * https://leetcode.com/problems/friend-circles/description/ * * There are N students
阅读全文
摘要:package LeetCode_162 /** * 162. Find Peak Element * https://leetcode.com/problems/find-peak-element/description/ * * A peak element is an element that
阅读全文
摘要:package LeetCode_1008 /** * 1008. Construct Binary Search Tree from Preorder Traversal * https://leetcode.com/problems/construct-binary-search-tree-fr
阅读全文
摘要:package LeetCode_889 import java.util.* /** * 889. Construct Binary Tree from Preorder and Postorder Traversal * https://leetcode.com/problems/constru
阅读全文
摘要:package LeetCode_106 /** * 106. Construct Binary Tree from Inorder and Postorder Traversal * https://leetcode.com/problems/construct-binary-tree-from-
阅读全文
摘要:package LeetCode_105 /** * 105. Construct Binary Tree from Preorder and Inorder Traversal * https://leetcode.com/problems/construct-binary-tree-from-p
阅读全文
摘要:package LeetCode_37 /** * 37. Sudoku Solver * https://leetcode.com/problems/sudoku-solver/description/ * * Write a program to solve a Sudoku puzzle by
阅读全文
摘要:package LeetCode_36 /** * 36. Valid Sudoku * https://leetcode.com/problems/valid-sudoku/description/ * * Determine if a 9x9 Sudoku board is valid. Onl
阅读全文
摘要:package LeetCode_168 /** * 168. Excel Sheet Column Title *https://leetcode.com/problems/excel-sheet-column-title/description/ * * Given a positive int
阅读全文
摘要:package LeetCode_692 import java.util.* import kotlin.collections.ArrayList import kotlin.collections.HashMap /** * 692. Top K Frequent Words * https:
阅读全文
摘要:package LeetCode_480 import java.util.* /** * 480. Sliding Window Median * https://leetcode.com/problems/sliding-window-median/description/ * * Median
阅读全文
摘要:package LeetCode_706 /** * 706. Design HashMap * https://leetcode.com/problems/design-hashmap/description/ * * Design a HashMap without using any buil
阅读全文
摘要:package LeetCode_295 import java.util.* /** * 295. Find Median from Data Stream * https://leetcode.com/problems/find-median-from-data-stream/descripti
阅读全文
摘要:package LeetCode_978 /** * 978. Longest Turbulent Subarray * https://leetcode.com/problems/longest-turbulent-subarray/description/ * * A subarray A[i]
阅读全文
摘要:package LeetCode_95 /** * 95. Unique Binary Search Trees II * https://leetcode.com/problems/unique-binary-search-trees-ii/description/ * https://zxi.m
阅读全文
摘要:package LeetCode_222 import java.util.* /** * 222. Count Complete Tree Nodes * https://leetcode.com/problems/count-complete-tree-nodes/description/ *
阅读全文
摘要:package LeetCode_637 import LeetCode_297.TreeNode import java.util.* import kotlin.collections.ArrayList /** * 637. Average of Levels in Binary Tree *
阅读全文