题目描述：
Given a nested list of integers represented as a string, implement a parser to deserialize it.
Each element is either an integer, or a list -- whose elements may also be integers or other lists.
Note ...
标签归档：leetcode
[LeetCode]Mini Parser
[LeetCode]Shuffle an Array
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 384. Shuffle an Array
Shuffle a set of numbers without duplicates.
Example:
// Init an array with set 1, 2, and 3.
int[] nums = {1,2,3};
Solution solution = new Solution(nums);
// Shuffle the array [1,2,3] and ...
[LeetCode]Ransom Note
作者是
发布于
在
LeetCode.
题目描述：
Given an arbitrary ransom note string and another string containing letters from all the magazines, write a function that will return true if the ransom note can be constructed from the magazines; otherwise, it will ...
[LeetCode]Linked List Random Node
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 382. Linked List Random Node
Given a singly linked list, return a random node's value from the linked list. Each node must have the same probability of being chosen.
Follow up:
What if the linked list is extremely ...
[LeetCode]Insert Delete GetRandom O(1) - Duplicates allowed
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 381. Insert Delete GetRandom O(1) - Duplicates allowed
Design a data structure that supports all following operations in average O(1) time.
Note: Duplicate elements are allowed.
insert(val): Inserts an item val to the collection.remove(val ...