Demon-初来驾到

POJ 刷题系列：1837. Balance传送门：1837. Balance题意： 一个天枰上有C个钩子，把M个砝码挂在这些C个钩子上，问多少种平衡的挂法。思路： 首先考虑单个砝码在天枰的位置，可以得到C个状态，对应的平衡度为:G[0] * C[i]，记录这些初始平衡度的个数。这样当放入第二个砝码时，可以遍历这些平衡度，从而得到一个新的平衡度。此时，不同位置，不同质量的砝...

LWC 74: 793. Preimage Size of Factorial Zeroes Function传送门：793. Preimage Size of Factorial Zeroes FunctionProblem: Let f(x) be the number of zeroes at the end of x!. (Recall that x! = 1 * 2 * ...

LWC 74: 795. Number of Subarrays with Bounded Maximum传送门：795. Number of Subarrays with Bounded MaximumProblem: We are given an array A of positive integers, and two positive integers L and R (...

LWC 74: 792. Number of Matching Subsequences传送门：792. Number of Matching SubsequencesProblem: Given string S and a dictionary of words words, find the number of words[i] that is a subsequence o...

LWC 74: 794. Valid Tic-Tac-Toe State传送门：794. Valid Tic-Tac-Toe StateProblem: A Tic-Tac-Toe board is given as a string array board. Return True if and only if it is possible to reach this board...

LWC 73: 790. Domino and Tromino Tiling传送门：790. Domino and Tromino TilingProblem: We have two types of tiles: a 2x1 domino shape, and an “L” tromino shape. These shapes may be rotated. XX ...

LWC 73: 791. Custom Sort String传送门：791. Custom Sort StringProblem: S and T are strings composed of lowercase letters. In S, no letter occurs more than once. S was sorted in some custom or...

LWC 73: 789. Escape The Ghosts传送门：789. Escape The GhostsProblem: You are playing a simplified Pacman game. You start at the point (0, 0), and your destination is (target[0], target1). There ar...

LWC 73: 788. Rotated Digits传送门：788. Rotated DigitsProblem: X is a good number if after rotating each digit individually by 180 degrees, we get a valid number that is different from X. A number...

LWC 72: 786. K-th Smallest Prime Fraction传送门：786. K-th Smallest Prime FractionProblem: A sorted list A contains 1, plus some number of primes. Then, for every p < q in the list, we conside...

LWC 72: 787. Cheapest Flights Within K Stops传送门：787. Cheapest Flights Within K StopsProblem: There are n cities connected by m flights. Each fight starts from city u and arrives at v with a pr...

LWC 72: 785. Is Graph Bipartite?传送门：785. Is Graph Bipartite?Problem: Given a graph, return true if and only if it is bipartite. Recall that a graph is bipartite if we can split it’s set o...

LWC 72: 784. Letter Case Permutation传送门：784. Letter Case PermutationProblem: Given a string S, we can transform every letter individually to be lowercase or uppercase to create another string....

LWC 71: 780. Reaching Points传送门：780. Reaching PointsProblem: A move consists of taking a point (x, y) and transforming it to either (x, x+y) or (x+y, y). Given a starting point (sx, sy) a...

LWC 71: 781. Rabbits in Forest传送门：781. Rabbits in ForestProblem: In a forest, each rabbit has some color. Some subset of rabbits (possibly all of them) tell you how many other rabbits have the...

LWC 71: 783. Minimum Distance Between BST Nodes传送门：783. Minimum Distance Between BST NodesProblem: Given a Binary Search Tree (BST) with the root node root, return the minimum difference betwe...

POJ 刷题系列：3274. Gold Balanced Lineup传送门：3274. Gold Balanced Lineup题意： 官方题解： Consider the partial sum sequence of each of the k features built by taking the sum of all the values up t

LWC 70: 778. Swim in Rising Water传送门：778. Swim in Rising WaterProblem: On an N x N grid, each square grid[i][j] represents the elevation at that point (i,j). Now rain starts to fall. At t

LWC 70: 777. Swap Adjacent in LR String传送门：777. Swap Adjacent in LR StringProblem: In a string composed of ‘L’, ‘R’, and ‘X’ characters, like “RXXLRXRXL”, a move consists of either replacing o

LWC 70: 776. Split BST传送门：776. Split BSTProblem: Given a Binary Search Tree (BST) with root node root, and a target value V, split the tree into two subtrees where one subtree has nodes that a

LWC 70: 779. K-th Symbol in Grammar传送门：779. K-th Symbol in GrammarProblem: On the first row, we write a 0. Now in every subsequent row, we look at the previous row and replace each occurrence

POJ 刷题系列：2503. Babelfish传送门：2503. Babelfish题意： 翻译：给出一英文单词和与之对应的外文，组成字典集。后续当给出一个外文单词时，求出对应的英文单词。思路： 无脑 HashMap，外文为key，英文单词为value，存入hashMap。代码如下：import java.io.IOException;import java

LWC 69: 774. Minimize Max Distance to Gas Station传送门：774. Minimize Max Distance to Gas StationProblem: On a horizontal number line, we have gas stations at positions stations[0], stations1, …,

LWC 69: 773. Sliding Puzzle传送门：773. Sliding PuzzleProblem: On a 2x3 board, there are 5 tiles represented by the integers 1 through 5, and an empty square represented by 0. A move consists

LWC 69: 775. Global and Local Inversions传送门：775. Global and Local InversionsProblem: We have some permutation A of [0, 1, …, N - 1], where N is the length of A. The number of (global) inv

LWC 68: 767. Reorganize String传送门：767. Reorganize StringProblem: Given a string S, check if the letters can be rearranged so that two characters that are adjacent to each other are not the sam

LWC 68: 769. Max Chunks To Make Sorted (ver. 1)传送门：769. Max Chunks To Make Sorted (ver. 1)Problem: Given an array arr that is a permutation of [0, 1, …, arr.length - 1], we split the array int

LWC 69: 771. Jewels and Stones传送门：771. Jewels and StonesProblem: You’re given strings J representing the types of stones that are jewels, and S representing the stones you have. Each characte

LWC 68: 766. Toeplitz Matrix传送门：766. Toeplitz MatrixProblem: A matrix is Toeplitz if every diagonal from top-left to bottom-right has the same element. Now given an M x N matrix, return T

POJ 刷题系列：1840. Eqs传送门：1840. Eqs题意： 等式 a1x31+a2x32+a3x33+a4x34+a5x35=0a_1x_1^3+ a_2x_2^3+ a_3x_3^3+ a_4x_4^3+ a_5x_5^3=0 ，其中ai∈[−50,50],i=1,2,3,4,5a_i \in [-50, 50], i = 1, 2, 3, 4, 5，xi∈[−50,5

POJ 刷题系列：3349. Snowflake Snow Snowflakes传送门：3349. Snowflake Snow Snowflakes题意： 每个雪花都有六个分支，用六个整数代表，这六个整数是从任意一个分支开始，朝顺时针或逆时针方向遍历得到的。输入多个雪花，判断是否有形状一致的雪花存在。思路： 和HASH检测冲突的原理很像，先对6个数进行HASH而不管顺序，

POJ 刷题系列：2299. Ultra-QuickSort传送门：2299. Ultra-QuickSort题意： 给出长度为n的序列，每次只能交换相邻的两个元素，问至少要交换几次才使得该序列为递增序列。思路： 实际上是让你求解逆序对的个数，求逆序对的个数可以采用归并排序。曾写过一篇关于算法细节系列（27）：时间复杂度为何还能优化？今天又重新复习了一遍，有了一些新的理解。

POJ 刷题系列：2388. Who’s in the Middle传送门：2388. Who’s in the Middle题意： 给定n个数，从小到大排列，求出中间大的数。思路： 直接排序，调用接口就非常方便了。代码如下：import java.io.BufferedReader;import java.io.File;import java.io.Fi

POJ 刷题系列：1936. All in All传送门：1936. All in All题意： 给定两个字符串s和t，你需要判断s是否是t的“子列”。也就是说，如果你去掉t中的某些字符，剩下字符将连接而成为s。思路： 动规or递归+记忆化，定义状态dp[i][j]表示T[0…i - 1] 及S[0…j - 1]能否构成子列，状态转移如下：if S[j] == T[

POJ 刷题系列：3080. Blue Jeans传送门：3080. Blue Jeans题意： 一组字符串，求字符串组的公共最长子串，如果有多个最长，取alphabetical order最小。思路： KMP + 暴力枚举子串，不过Java关于模式匹配，已有封装好的代码，如下：import java.io.BufferedReader;import java.i

LWC 67: 765. Couples Holding Hands传送门：765. Couples Holding HandsProblem: N couples sit in 2N seats arranged in a row and want to hold hands. We want to know the minimum number of swaps so that

LWC 67: 764. Largest Plus Sign传送门：764. Largest Plus SignProblem: In a 2D grid from (0, 0) to (N-1, N-1), every cell contains a 1, except those cells in the given list mines which are 0. What i

LWC 67: 763. Partition Labels传送门：763. Partition LabelsProblem: A string S of lowercase letters is given. We want to partition this string into as many parts as possible so that each letter app

LWC 67: 762. Prime Number of Set Bits in Binary Representation传送门：762. Prime Number of Set Bits in Binary RepresentationProblem: Given two integers L and R, find the count of numbers in the ra

POJ 刷题系列：1035. Spell checker传送门：1035. Spell checker题意： 一组字符串，组成字典。查询某个字符串是否在该字典中。如果不存在，输出字典集中与查询字符串编辑距离为1的字符串。思路： 因为每个字符串的最大长度为15，查询O(1)，采用暴力。代码如下：import java.io.BufferedReader;import