79. Word Search 题目 Given a 2D board and a word, find if the word exists in the grid. The word can be construct…
分类:LeetCode
[LeetCode] Split Array into Consecutive Subsequences 将数组分割成连续子序列
You are given an integer array sorted in ascending order (may contain duplicates), you need to split th…
LeetCode | 3Sum
题目: Given an array S of n integers, are there elements a, b, c in …
力扣(LeetCode)142
题目地址:https://leetcode-cn.com/probl…题目描述:给定一个链表,返回链表开始入环的第一个节点。 如果链表无环,则返回 null。 为了表示给定链表中的环,我们使用整数 pos 来…
LeetCode | Unique Paths II(唯一路径II)
Follow up for “Unique Paths”: Now consider if some obstacles are added to the grids. How many uniq…
054 Spiral Matrix[M]
1 题目描述 Given a matrix of m x n elements ( m rows, n columns), return all elements of the matrix in spiral orde…
[LintCode][System Design] Shape Factory
Problem More LeetCode Discussions Factory is design pattern in common usage. Implement a ShapeFactory that can…
枚举——完美立方
文章作者:Tyan 博客:noahsnail.com | CSDN | 简书 | 云+社区 1. 枚举 枚举是基于逐个尝试答案的一种问题求解策略。 2. 完美…
力扣(LeetCode) -139 单词拆分
本题考察的是动态规划 题目描述 给定一个非空字符串 s 和一个包含非空单词列表的字典 wordDict,判定 s 是否可以被空格拆分为一个或多个在字典中出现的单词。 说明: 拆分时可以重复使用字典中的单词。 你可以假设字…
Leetcode 155. Min Stack
Design a stack that supports push, pop, top, and retrieving the minimum element in constant time. push(x) R…
LeetCode刷题之Range Addition II
Problem Given an m * n matrix M initialized with all 0‘s and several update operations. Operations are r…
[LeetCode] Flatten Nested List Iterator 压平嵌套链表迭代器
Given a nested list of integers, implement an iterator to flatten it. Each element is either an integer…