首页
AI Coding
NEW
沸点
课程
直播
活动
AI刷题
APP
插件
搜索历史
清空
创作者中心
写文章
发沸点
写笔记
写代码
草稿箱
创作灵感
查看更多
会员
登录
注册
小强刷题~
樱黯雨
创建于2021-06-18
订阅专栏
记录LeetCode刷题历程
等 1 人订阅
共117篇文章
创建于2021-06-18
订阅专栏
默认顺序
默认顺序
最早发布
最新发布
168. Excel Sheet Column Title
Given a positive integer, return its corresponding column title as appear in an Excel sheet.
167. Two Sum II - Input array is sorted
Given an array of integers that is already sorted in ascending order, find two numbers such that the
155. Min Stack
Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.
141. Linked List Cycle
Given a linked list, determine if it has a cycle in it. To represent a cycle in the given linked lis
136. Single Number
Given a non-empty array of integers, every element appears twice except for one. Find that single on
125. Valid Palindrome
Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignori
122. Best Time to Buy and Sell Stock II
Say you have an array prices for which the ith element is the price of a given stock on day i. Desig
121. Best Time to Buy and Sell Stock
Say you have an array for which the ith element is the price of a given stock on day i. If you were
119. Pascal's Triangle II
Given a non-negative index k where k ≤ 33, return the kth index row of the Pascal's triangle. Note t
118. Pascal's Triangle
Given a non-negative integer numRows, generate the first numRows of Pascal's triangle. In Pascal's t
112. Path Sum
Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all
111. Minimum Depth of Binary Tree
Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shor
110. Balanced Binary Tree
Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary
108. Convert Sorted Array to Binary Search Tree
Given an array where elements are sorted in ascending order, convert it to a height balanced BST.For
107. Binary Tree Level Order Traversal II
Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left
104. Maximum Depth of Binary Tree
Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the long
101. Symmetric Tree
Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).
100. Same Tree
Given two binary trees, write a function to check if they are the same or not. Two binary trees are
88. Merge Sorted Array
Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.
83. Remove Duplicates from Sorted List
Given a sorted linked list, delete all duplicates such that each element appear only once.
下一页