11 2017 档案
摘要：原题链接在这里：https://leetcode.com/problems/shuffle-an-array/ 题目： Shuffle a set of numbers without duplicates. Example: 题解： Shuffle时每个数字在小于它的方位内 swap 一次. j
阅读全文
摘要：原题链接在这里：https://leetcode.com/problems/number-of-distinct-islands/description/ 题目： Given a non-empty 2D array grid of 0's and 1's, an island is a group
阅读全文
摘要：原题链接在这里：https://leetcode.com/problems/find-largest-value-in-each-tree-row/description/ 题目： You need to find the largest value in each row of a binary
阅读全文
摘要：原题链接在这里：https://leetcode.com/problems/sparse-matrix-multiplication/description/ 题目： Given two sparse matrices A and B, return the result of AB. You ma
阅读全文
摘要：原题链接在这里：https://leetcode.com/problems/partition-to-k-equal-sum-subsets/description/ 题目： Given an array of integers nums and a positive integer k, find
阅读全文
摘要：原题链接在这里：https://leetcode.com/problems/max-stack/description/ 题目： Design a max stack that supports push, pop, top, peekMax and popMax. push(x) -- Push
阅读全文
摘要：原题链接在这里：https://leetcode.com/problems/nested-list-weight-sum-ii/description/ 题目： Given a nested list of integers, return the sum of all integers in th
阅读全文
摘要：原题链接在这里：https://leetcode.com/problems/encode-and-decode-tinyurl/ 题目： TinyURL is a URL shortening service where you enter a URL such as https://leetcod
阅读全文
摘要：原题链接在这里：https://leetcode.com/problems/replace-words/description/ 题目： In English, we have a concept called root, which can be followed by some other wo
阅读全文
摘要：原题链接在这里：https://leetcode.com/problems/valid-triangle-number/ 题目： Given an array consists of non-negative integers, your task is to count the number of
阅读全文
摘要：原题链接在这里：https://leetcode.com/problems/design-tinyurl/description/ 题目： How would you design a URL shortening service that is similar to TinyURL? Backgr
阅读全文
摘要：原题链接在这里：https://leetcode.com/problems/create-maximum-number/description/ 题目： Given two arrays of length m and n with digits 0-9 representing two numbe
阅读全文
摘要：原题链接在这里：https://leetcode.com/problems/maximum-swap/ 题目： Given a non-negative integer, you could swap two digits at most once to get the maximum valued
阅读全文
