首页
AI Coding
NEW
沸点
课程
直播
活动
AI刷题
APP
插件
搜索历史
清空
创作者中心
写文章
发沸点
写笔记
写代码
草稿箱
创作灵感
查看更多
会员
登录
注册
LeetCode
dsyislearning
创建于2022-09-12
订阅专栏
做题记录
暂无订阅
共58篇文章
创建于2022-09-12
订阅专栏
默认顺序
默认顺序
最早发布
最新发布
20221026 - 862. Shortest Subarray with Sum at Least K 和至少为 K 的最短子数组(前缀和+单调双端队列)
Given an integer array nums and an integer k, return the length of the shortest non-empty subarray o
20221025 - 934. Shortest Bridge最短的桥(广度优先搜索)
You are given an $n \times n$ binary matrix grid where 1 represents land and 0 represents water. An
20221024 - 915. Partition Array into Disjoint Intervals 分割数组(遍历)
Given an integer array nums, partition it into two (contiguous) subarrays left and right so that: Ev
20221023 - 1768. Merge Strings Alternately 交替合并字符串(双指针)
You are given two strings word1 and word2. Merge the strings by adding letters in alternating order,
20221022 - 1235. Maximum Profit in Job Scheduling 规划兼职工作(动态规划)
We have n jobs, where every job is scheduled to be done from startTime[i] to endTime[i], obtaining a
20221021 - 901. Online Stock Span 股票价格跨度(单调栈)
Design an algorithm that collects daily price quotes for some stock and returns the span of that sto
20221020 - 779. K-th Symbol in Grammar 第K个语法符号(递归)
We build a table of n rows (1-indexed). We start by writing 0 in the 1-st row. Now in every subseque
20221019 - 1700. Number of Students Unable to Eat Lunch 无法吃午餐学生数量(模拟)
The school cafeteria offers circular and square sandwiches at lunch break, referred to by numbers 0
20221018 - 902. Numbers At Most N Given Digit Set 最大为 N 的数字组合(数位动态规划)
Given an array of digits which is sorted in non-decreasing order. You can write numbers using each d
20221017 - 904. Fruit Into Baskets 水果成篮(滑动窗口)
You are visiting a farm that has a single row of fruit trees arranged from left to right. The trees
20221016 - 886. Possible Bipartition 可能的二分法(搜索)
We want to split a group of n people (labeled from 1 to n) into two groups of any size. Each person
20221015 - 1441. Build an Array With Stack Operations 用栈操作构建数组(模拟)
You are given an integer array target and an integer n. You have an empty stack with the two followi
20221014 - 940. Distinct Subsequences II 不同的子序列 2(动态规划)
Given a string s, return the number of distinct non-empty subsequences of s. Since the answer may be
20221013 - 769. Max Chunks To Make Sorted 最多能完成排序的块(贪心)
You are given an integer array arr of length n that represents a permutation of the integers in the
20221012 - 817. Linked List Components 链表组件(哈希表)
You are given the head of a linked list containing unique integer values and an integer array nums t
20221011 - 1790. Check if One String Swap Can Make Strings Equal(字符串)
You are given two strings s1 and s2 of equal length. A string swap is an operation where you choose
20221010 - 801. Minimum Swaps To Make Sequences Increasing 使序列递增的最小交换次数(动态规划)
You are given two integer arrays of the same length nums1 and nums2. In one operation, you are allow
20221009 - 856. Score of Parentheses 括号的分数(栈)
Given a balanced parentheses string s, return the score of the string. The score of a balanced paren
20221008 - 870. Advantage Shuffle 优势洗牌(田忌赛马)
You are given two integer arrays nums1 and nums2 both of the same length. The advantage of nums1 wit
20221007 - 1800. Maximum Ascending Subarray Sum(在线处理)
Given an array of positive integers nums, return the maximum possible sum of an ascending subarray i
下一页