搜索结果
查询Tags标签： Balanced，共有 11条记录-
B. A Perfectly Balanced String?
题目链接 B. A Perfectly Balanced String? 给出一个字符串 \(s\) ，对于 \(s\) 中出现过的任意两个字母 \(u, v\) ，定义一个 Balanced 的字符串满足在任何 一个子串中 \(u\) 和 \(v\) 的出现次数相差不超过 1 . 判断字符串是否满足 Balanced 条件. 解题思路思维满足条件…
2022/5/1 23:18:31 人评论 次浏览 -
LeetCode 1963. Minimum Number of Swaps to Make the String Balanced
原题链接在这里：https://leetcode.com/problems/minimum-number-of-swaps-to-make-the-string-balanced/ 题目： You are given a 0-indexed string s of even length n. The string consists of exactly n / 2 opening brackets [ and n / 2 closing brackets ]. A stri…
2022/5/1 6:12:52 人评论 次浏览 -
洛谷P2880 [USACO07JAN] Balanced Lineup G（树状数组/线段树）
维护区间最值的模板题。 1.树状数组1 #include<bits/stdc++.h>2 //树状数组做法 3 using namespace std;4 const int N=5e4+10;5 int m,ma[N],mi[N],n,c[N];6 7 int lowbit(int x){8 return x&(-x);9 } 10 11 void ins(int x,int v){ 12 while(x<=n…
2022/4/22 23:17:16 人评论 次浏览 -
[LeetCode] 110. Balanced Binary Tree
Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as: a binary tree in which the left and right subtrees of every node differ in height by no more than 1. Example1: Input: root = [3,9,2…
2022/1/9 6:07:33 人评论 次浏览 -
[LeetCode] 110. Balanced Binary Tree
Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as: a binary tree in which the left and right subtrees of every node differ in height by no more than 1. Example1: Input: root = [3,9,2…
2022/1/9 6:07:33 人评论 次浏览 -
[LeetCode] 1221. Split a String in Balanced Strings 分割平衡字符串
Balanced strings are those that have an equal quantity of L and R characters. Given a balanced string s, split it in the maximum amount of balanced strings. Return the maximum amount of split balanced strings. Example 1: Input: s = "RLRRLLRLRL&qu…
2021/9/14 6:08:12 人评论 次浏览 -
[LeetCode] 1221. Split a String in Balanced Strings 分割平衡字符串
Balanced strings are those that have an equal quantity of L and R characters. Given a balanced string s, split it in the maximum amount of balanced strings. Return the maximum amount of split balanced strings. Example 1: Input: s = "RLRRLLRLRL&qu…
2021/9/14 6:08:12 人评论 次浏览 -
1221. Split a String in Balanced Strings
题目： Balanced strings are those that have an equal quantity of L and R characters. Given a balanced string s, split it in the maximum amount of balanced strings. Return the maximum amount of split balanced strings.Example 1: Input: s = "RLRRLLR…
2021/9/7 23:10:33 人评论 次浏览 -
1221. Split a String in Balanced Strings
题目： Balanced strings are those that have an equal quantity of L and R characters. Given a balanced string s, split it in the maximum amount of balanced strings. Return the maximum amount of split balanced strings.Example 1: Input: s = "RLRRLLR…
2021/9/7 23:10:33 人评论 次浏览 -
Balanced Binary Tree
Code link: https://leetcode.com/problems/balanced-binary-tree/ Constraint:The number of nodes in the tree is in the range [0, 5000]. This means we can use recursion?Idea: Note the definition of height and depth might be differnt from the official def…
2021/7/29 6:06:03 人评论 次浏览 -
Balanced Binary Tree
Code link: https://leetcode.com/problems/balanced-binary-tree/ Constraint:The number of nodes in the tree is in the range [0, 5000]. This means we can use recursion?Idea: Note the definition of height and depth might be differnt from the official def…
2021/7/29 6:06:03 人评论 次浏览
