摘要：
Summary Ranges (M) 题目 Given a sorted integer array without duplicates, return the summary of its ranges. Example 1: Input: [0,1,2,4,5,7] Output: ["0-> 阅读全文
摘要：
Linked List Cycle II (M) 题目 Given a linked list, return the node where the cycle begins. If there is no cycle, return null. To represent a cycle in th 阅读全文
摘要：
Champagne Tower (M) 题目 We stack glasses in a pyramid, where the first row has 1 glass, the second row has 2 glasses, and so on until the 100th row. Ea 阅读全文
摘要：
Stone Game IV (H) 题目 Alice and Bob take turns playing a game, with Alice starting first. Initially, there are n stones in a pile. On each player's tur 阅读全文
摘要：
Bag of Tokens (M) 题目 You have an initial power of P, an initial score of 0, and a bag of tokens where tokens[i] is the value of the ith token (0-index 阅读全文
摘要：
132 Pattern (M) 题目 Given an array of n integers nums, a 132 pattern is a subsequence of three integers nums[i], nums[j] and nums[k] such that i < j < 阅读全文
摘要：
Minimum Depth of Binary Tree (E) 题目 Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shortest path from 阅读全文
摘要：
Asteroid Collision (M) 题目 We are given an array asteroids of integers representing asteroids in a row. For each asteroid, the absolute value represent 阅读全文
摘要：
Clone Graph (M) 题目 Given a reference of a node in a connected undirected graph. Return a deep copy (clone) of the graph. Each node in the graph contai 阅读全文
摘要：
Minimum Domino Rotations For Equal Row (M) 题目 In a row of dominoes, A[i] and B[i] represent the top and bottom halves of the ith domino. (A domino is 阅读全文