摘要：
Given a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent. A mapping of digit to le 阅读全文
阅读排行榜
[LeetCode] 87. Scramble String_hard tag: 区间Dynamic Programming?
2019-07-05 07:01 by Johnson_强生仔仔, 244 阅读, 收藏,
摘要：
Given a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively. Below is one possible representati 阅读全文
[LeetCode] 407. Trapping Rain Water II_hard tag: Heap
2019-06-12 10:05 by Johnson_强生仔仔, 243 阅读, 收藏,
摘要：
Given an m x n matrix of positive integers representing the height of each unit cell in a 2D elevation map, compute the volume of water it is able to 阅读全文
[LeetCode] 693. Binary Number with Alternating Bits_Easy
2018-08-28 00:42 by Johnson_强生仔仔, 243 阅读, 收藏,
摘要：
Given a positive integer, check whether it has alternating bits: namely, if two adjacent bits will always have different values. Example 1: Input: 5 O 阅读全文
[LeetCode] 232. Implement Queue using Stacks_Easy tag: Design
2018-08-16 09:49 by Johnson_强生仔仔, 243 阅读, 收藏,
摘要：
Implement the following operations of a queue using stacks. push(x) -- Push element x to the back of queue. pop() -- Removes the element from in front 阅读全文
浙公网安备 33010602011771号