06 2020 档案
摘要:package LeetCode_93 /** * 93. Restore IP Addresses * https://leetcode.com/problems/restore-ip-addresses/description/ * * Given a string containing onl
阅读全文
摘要:package LeetCode_210 import java.util.* import kotlin.collections.ArrayList /** * 210. Course Schedule II * https://leetcode.com/problems/course-sched
阅读全文
摘要:package LeetCode_207 import java.util.* import kotlin.collections.ArrayList /** * 207. Course Schedule * https://leetcode.com/problems/course-schedule
阅读全文
摘要:package LeetCode_128 /** * 128. Longest Consecutive Sequence * https://leetcode.com/problems/longest-consecutive-sequence/description/ * * Given an un
阅读全文
摘要:package LeetCode_60 import java.lang.StringBuilder /** * 60. Permutation Sequence * https://leetcode.com/problems/permutation-sequence/description/ *
阅读全文
摘要:package LeetCode_31 /** * 31. Next Permutation * https://leetcode.com/problems/next-permutation/description/ * Implement next permutation, which rearr
阅读全文
摘要:package LeetCode_10 /** * 10. Regular Expression Matching * https://leetcode.com/problems/regular-expression-matching/description/ * * Given an input
阅读全文
摘要:package LeetCode_916 /** * 916. Word Subsets *https://leetcode.com/problems/word-subsets/description/ * * We are given two arrays A and B of words. Ea
阅读全文
摘要:package LeetCode_246 /** * 246. Strobogrammatic Number * (locked by Leetcode) * https://www.lintcode.com/problem/strobogrammatic-number/description *
阅读全文
摘要:package LeetCode_445 import LeetCode_2.ListNode /** * 445. Add Two Numbers II * https://leetcode.com/problems/add-two-numbers-ii/description/ * * You
阅读全文
摘要:package LeetCode_2 /** * 2. Add Two Numbers * https://leetcode.com/problems/add-two-numbers/description/ * * You are given two non-empty linked lists
阅读全文
摘要:package LeetCode_341 /** * 341. Flatten Nested List Iterator * https://leetcode.com/problems/flatten-nested-list-iterator/description/ * * Given a nes
阅读全文
摘要:package LeetCode_468 /** * 468. Validate IP Address * https://leetcode.com/problems/validate-ip-address/description/ * * Write a function to check whe
阅读全文
摘要:package LeetCode_297 import java.util.* /** * 297. Serialize and Deserialize Binary Tree * https://leetcode.com/problems/serialize-and-deserialize-bin
阅读全文
摘要:package LeetCode_260 /** * 260. Single Number III * https://leetcode.com/problems/single-number-iii/description/ * * Given an array of numbers nums, i
阅读全文
摘要:package arrays /** * https://www.hackerrank.com/challenges/ctci-array-left-rotation/problem * * A left rotation operation on an array shifts each of t
阅读全文
摘要:package LeetCode_693 /** * 693. Binary Number with Alternating Bits * https://leetcode.com/problems/binary-number-with-alternating-bits/description/ *
阅读全文
摘要:fun hammingWeight(n: Int): Int { /** * 以下是完整的位运算符(只用语Int和Long) shl(bits) – 有符号左移(signed shift left,相当于Java的<<) shr(bits) – 有符号右移(signed shift right,相当
阅读全文
摘要:package LeetCode_268 /** * 268. Missing Number * https://leetcode.com/problems/missing-number/description/ * * Given an array containing n distinct nu
阅读全文
摘要:package LeetCode_1275 /** * 1275. Find Winner on a Tic Tac Toe Game * https://leetcode.com/problems/find-winner-on-a-tic-tac-toe-game/description/ * *
阅读全文
摘要:package LeetCode_348 /** * 348. Design Tic-Tac-Toe * (Lock by leetcode) * https://www.lintcode.com/problem/design-tic-tac-toe/description * Design a T
阅读全文
摘要:package LeetCode_65 /** * 65. Valid Number * https://leetcode.com/problems/valid-number/description/ * * Validate if a given string can be interpreted
阅读全文
摘要:package LeetCode_934 import java.util.* /** * 934. Shortest Bridge * https://leetcode.com/problems/shortest-bridge/description/ * * In a given 2D bina
阅读全文
摘要:package LeetCode_76 /** * 76. Minimum Window Substring * https://leetcode.com/problems/minimum-window-substring/description/ * * Given a string S and
阅读全文
摘要:package LeetCode_424 /** * 424. Longest Repeating Character Replacement * https://leetcode.com/problems/longest-repeating-character-replacement/descri
阅读全文
摘要:package LeetCode_438 /** * 438. Find All Anagrams in a String * https://leetcode.com/problems/find-all-anagrams-in-a-string/description/ * * Given a s
阅读全文
摘要:package LeetCode_961 /** * 961. N-Repeated Element in Size 2N Array * https://leetcode.com/problems/n-repeated-element-in-size-2n-array/description/ *
阅读全文
摘要:package _interview_question import java.util.* import kotlin.collections.ArrayList /** * 有1千万个随机数,随机数的范围在1到1亿之间。现在要求写出一种算法,将1到1亿之间没有在随机数中的数求出来? * */ c
阅读全文
摘要:什么是Bitset Bitset,也就是位图,由于可以用非常紧凑的格式来表示给定范围的连续数据而经常出现在各种算法设计上。 基本原理是,用1位来表示一个数据是否出现过,0为没有出现过,1表示出现过。使用的时候既可根据一个是否为0表示此数是否出现过。 1G的空间,有8*1024*1024*1024=8
阅读全文
摘要:package LeetCode_670 /** * 670. Maximum Swap * https://leetcode.com/problems/maximum-swap/description/ * * Given a non-negative integer, you could swa
阅读全文
摘要:package LeetCode_57 /** * 57. Insert Interval * https://leetcode.com/problems/insert-interval/description/ * * Given a set of non-overlapping interval
阅读全文
摘要:package _Sort.Algorithm /** * Insertion Sort * https://www.geeksforgeeks.org/insertion-sort/ * Insertion Sort is a simple sorting algorithm that works
阅读全文
摘要:package LeetCode_56 /** * 56. Merge Intervals * https://leetcode.com/problems/merge-intervals/description/ * * Given a collection of intervals, merge
阅读全文
摘要:package LeetCode_796 /** * 796. Rotate String * https://leetcode.com/problems/rotate-string/description/ * We are given two strings, A and B. A shift
阅读全文
摘要:package LeetCode_787 import java.util.* import kotlin.collections.ArrayList import kotlin.collections.HashMap /** * 787. Cheapest Flights Within K Sto
阅读全文
摘要:package _Algorithm.BellmanFord class BellmanFord { //create graph val ab = Edge("A", "B", -1) val ac = Edge("A", "C", 4) val bc = Edge("B", "C", 3) va
阅读全文
摘要:什么是Bellman-Ford算法? Bellman-Ford,是求解单源最短路经问题的一种算法,由Richard Bellman和莱斯特.福特创立的。它的原理是对图进行|V|-1次松弛操作,得到所有可能的最短路经。其优于Dijkstra的方面是边的权值可以为负数、实现简单,缺点是时间复杂度高,高达
阅读全文
摘要:package LeetCode_941 /** * 941. Valid Mountain Array * https://leetcode.com/problems/valid-mountain-array/description/ * * Given an array A of integer
阅读全文
摘要:package LeetCode_1475 import java.util.* /** * 1475. Final Prices With a Special Discount in a Shop * https://leetcode.com/problems/final-prices-with-
阅读全文
摘要:package LeetCode_282 /** * 282. Expression Add Operators * https://leetcode.com/problems/expression-add-operators/description/ * * Given a string that
阅读全文
摘要:package LeetCode_503 import java.util.* /** * 503. Next Greater Element II * https://leetcode.com/problems/next-greater-element-ii/description/ * * Gi
阅读全文
摘要:package LeetCode_227 import java.util.* /** * 227. Basic Calculator II * https://leetcode.com/problems/basic-calculator-ii/description/ * * Implement
阅读全文
摘要:package LeetCode_224 import java.util.* /** * 224. Basic Calculator * https://leetcode.com/problems/basic-calculator/description/ * * Implement a basi
阅读全文
摘要:package LeetCode_40 /** * 40. Combination Sum II * https://leetcode.com/problems/combination-sum-ii/description/ * * Given a collection of candidate n
阅读全文
摘要:package _interview_question /** * Check if a given target element is found in the infinite long sorted array. * */ class Solution8 { /** * solution: b
阅读全文
摘要:package LeetCode_280 /** * 280. Wiggle Sort * (locked by leetcode) * https://www.lintcode.com/problem/wiggle-sort/description * * Given an unsorted ar
阅读全文
摘要:package LeetCode_559 import java.util.* /** * 559. Maximum Depth of N-ary Tree * https://leetcode.com/problems/maximum-depth-of-n-ary-tree/description
阅读全文
摘要:package LeetCode_1411 /** * 1411. Number of Ways to Paint N × 3 Grid * https://leetcode.com/problems/number-of-ways-to-paint-n-3-grid/description/ * *
阅读全文
摘要:package LeetCode_139 /** * 139. Word Break * https://leetcode.com/problems/word-break/description/ * * Example 1: Input: s = "leetcode", wordDict = ["
阅读全文
摘要:package LeetCode_140 /** * 140. Word Break II * https://leetcode.com/problems/word-break-ii/description/ * * Given a non-empty string s and a dictiona
阅读全文
摘要:package LeetCode_403 /** * 403. Frog Jump * https://leetcode.com/problems/frog-jump/description/ * * A frog is crossing a river. * The river is divide
阅读全文
摘要:package _Sort.Algorithm /** * https://www.geeksforgeeks.org/counting-sort/ * It is not a comparison based sorting. * It running time complexity is O(n
阅读全文
摘要:package LeetCode_767 import java.util.* import kotlin.collections.HashMap /** * 767. Reorganize String * https://leetcode.com/problems/reorganize-stri
阅读全文
摘要:package LeetCode_1092 import java.lang.StringBuilder /** * 1092. Shortest Common Supersequence * https://leetcode.com/problems/shortest-common-superse
阅读全文
摘要:package LeetCode_1143 /** * 1143. Longest Common Subsequence * https://leetcode.com/problems/longest-common-subsequence/description/ * * Given two str
阅读全文
摘要:package LeetCode_491 /** * 491. Increasing Subsequences * https://leetcode.com/problems/increasing-subsequences/description/ * Given an integer array,
阅读全文
摘要:package LeetCode_450 import LeetCode_814.TreeNode /** * 450. Delete Node in a BST * https://leetcode.com/problems/delete-node-in-a-bst/description/ *
阅读全文
摘要:package _interview_question /** * Problem: Find the most frequent element in all intervals Given an unsorted list of start and end time ( a range basi
阅读全文
摘要:package LeetCode_1365 import java.util.* /** * 1365. How Many Numbers Are Smaller Than the Current Number * https://leetcode.com/problems/how-many-num
阅读全文
摘要:package LeetCode_333 import main.TreeNode /** * 333. Largest BST Subtree * Given a binary tree, find the largest subtree which is a Binary Search Tree
阅读全文
摘要:package LeetCode_98 import main.TreeNode /** * 98. Validate Binary Search Tree * https://leetcode.com/problems/validate-binary-search-tree/description
阅读全文
摘要:package LeetCode_663 import main.TreeNode import java.util.* /** * 663. Equal Tree Partition * (locked by leetcode) * https://www.lintcode.com/problem
阅读全文
摘要:package LeetCode_814 /** * 814. Binary Tree Pruning * https://leetcode.com/problems/binary-tree-pruning/description/ * * We are given the head node ro
阅读全文
摘要:package LeetCode_50 /** * 50. Pow(x, n) * https://leetcode.com/problems/powx-n/description/ * * Implement pow(x, n), which calculates x raised to the
阅读全文
摘要:package LeetCode_698 /** * 698. Partition to K Equal Sum Subsets * https://leetcode.com/problems/partition-to-k-equal-sum-subsets/description/ * * Giv
阅读全文
摘要:package LeetCode_416 /** * 416. Partition Equal Subset Sum * https://leetcode.com/problems/partition-equal-subset-sum/description/ * * Given a non-emp
阅读全文
摘要:package LeetCode_150 import java.util.* /** * 150. Evaluate Reverse Polish Notation * https://leetcode.com/problems/evaluate-reverse-polish-notation/d
阅读全文
摘要:package LeetCode_322 /** * 322. Coin Change * https://leetcode.com/problems/coin-change/description/ * * You are given coins of different denomination
阅读全文