IP属地：加州
-
LeetCode 336. Palindrome Pairs
对每个word，如果它翻转过来之后[:n]或者[n:]和map中已有的key相同，且剩下的一部分是palindrome，那么它们能组成palin...
-
LeetCode 444. Sequence Reconstruction
Check whether the original sequence org can be uniquely reconstructed fr...
-
LeetCode 84. Largest Rectangle in Histogram
Given n non-negative integers representing the histogram's bar height wh...
-
JINGCHI.AI店面利口489扫地机器人
Given a robot cleaner in a room modeled as a grid.Each cell in the grid ...
-
Subsequences
300 Longest Increasing Subsequence O(n^2) SolutionO(nlogn) Solution Foll...
-
Palindrome
866 Prime Palindrome Find the smallest prime palindrome greater than or ...
-
送外卖小公司OA
中缀表达式转后缀表达式的方法： 遇到操作数：直接输出(添加到后缀表达式中) 栈为空时，遇到运算符，直接入栈 遇到左括号：将其入栈 遇到右括号：执...
-
小公司Scalyr OA Sprint Training给你一个array，对每两个相邻位置i，j，认为[i, j]都被遍历到一次，求被遍历次数最多的indices中最小的index。 Solutio...
-
LeetCode 493 Reverse Pairs / 315 Count of Smaller Numbers After Self
Similarity Break down the array and solve for the subproblems Three Impl...