leetcode.com 2026-10-03
🔴32.longest-valid-parentheses
🏷️ Tags
#stack #string #dynamic_programming #bracket_sequences
🔴32.longest-valid-parentheses
🏷️ Tags
#stack #string #dynamic_programming #bracket_sequences
Telegraph
longest-valid-parentheses
Given a string containing just the characters '(' and ')', return the length of the longest valid (well-formed) parentheses substring. Example 1: Input: s = "(()" Output: 2 Explanation: The longest valid parentheses substring is "()". Example 2: Input:…
leetcode.cn 2026-10-04
🟡678.valid-parenthesis-string
🏷️ Tags
#stack #greedy #string #dynamic_programming #bracket_sequences
🟡678.valid-parenthesis-string
🏷️ Tags
#stack #greedy #string #dynamic_programming #bracket_sequences
Telegraph
valid-parenthesis-string
给你一个只包含三种字符的字符串,支持的字符类型分别是 '('、')' 和 '*'。请你检验这个字符串是否为有效字符串,如果是 有效 字符串返回 true 。 有效 字符串符合如下规则:
leetcode.com 2026-10-04
🟡678.valid-parenthesis-string
🏷️ Tags
#stack #greedy #string #dynamic_programming #bracket_sequences
🟡678.valid-parenthesis-string
🏷️ Tags
#stack #greedy #string #dynamic_programming #bracket_sequences
Telegraph
valid-parenthesis-string
Given a string s containing only three types of characters: '(', ')' and '*', return true if s is valid. The following rules define a valid string:
leetcode.cn 2026-10-06
🟡921.minimum-add-to-make-parentheses-valid
🏷️ Tags
#stack #greedy #string #bracket_sequences
🟡921.minimum-add-to-make-parentheses-valid
🏷️ Tags
#stack #greedy #string #bracket_sequences
Telegraph
minimum-add-to-make-parentheses-valid
只有满足下面几点之一,括号字符串才是有效的:
leetcode.com 2026-10-06
🟡921.minimum-add-to-make-parentheses-valid
🏷️ Tags
#stack #greedy #string #bracket_sequences
🟡921.minimum-add-to-make-parentheses-valid
🏷️ Tags
#stack #greedy #string #bracket_sequences
Telegraph
minimum-add-to-make-parentheses-valid
A parentheses string is valid if and only if:
leetcode.cn 2026-10-09
🟡1541.minimum-insertions-to-balance-a-parentheses-string
🏷️ Tags
#stack #greedy #string #bracket_sequences
🟡1541.minimum-insertions-to-balance-a-parentheses-string
🏷️ Tags
#stack #greedy #string #bracket_sequences
Telegraph
minimum-insertions-to-balance-a-parentheses-string
给你一个括号字符串 s ,它只包含字符 '(' 和 ')' 。一个括号字符串被称为平衡的当它满足:
leetcode.com 2026-10-09
🟡1541.minimum-insertions-to-balance-a-parentheses-string
🏷️ Tags
#stack #greedy #string #bracket_sequences
🟡1541.minimum-insertions-to-balance-a-parentheses-string
🏷️ Tags
#stack #greedy #string #bracket_sequences
Telegraph
minimum-insertions-to-balance-a-parentheses-string
Given a parentheses string s containing only the characters '(' and ')'. A parentheses string is balanced if:
leetcode.cn 2026-11-13
🔴3420.count-non-decreasing-subarrays-after-k-operations
🏷️ Tags
#stack #segment_tree #queue #array #sliding_window #monotonic_queue #monotonic_stack
🔴3420.count-non-decreasing-subarrays-after-k-operations
🏷️ Tags
#stack #segment_tree #queue #array #sliding_window #monotonic_queue #monotonic_stack
Telegraph
count-non-decreasing-subarrays-after-k-operations
给你一个长度为 n 的数组 nums 和一个整数 k 。 对于 nums 中的每一个子数组,你可以对它进行 至多 k 次操作。每次操作中,你可以将子数组中的任意一个元素增加 1 。 注意 ,每个子数组都是独立的,也就是说你对一个子数组的修改不会保留到另一个子数组中。 请你返回最多 k 次操作以内,有多少个子数组可以变成 非递减 的。 如果一个数组中的每一个元素都大于等于前一个元素(如果前一个元素存在),那么我们称这个数组是 非递减 的。 示例 1: 输入:nums = [6,3,1,2,4,4], k…
leetcode.com 2026-11-13
🔴3420.count-non-decreasing-subarrays-after-k-operations
🏷️ Tags
#stack #segment_tree #queue #array #sliding_window #monotonic_queue #monotonic_stack
🔴3420.count-non-decreasing-subarrays-after-k-operations
🏷️ Tags
#stack #segment_tree #queue #array #sliding_window #monotonic_queue #monotonic_stack
Telegraph
count-non-decreasing-subarrays-after-k-operations
You are given an array nums of n integers and an integer k. For each subarray of nums, you can apply up to k operations on it. In each operation, you increment any element of the subarray by 1. Note that each subarray is considered independently, meaning…