搜索结果
查询Tags标签： 1190，共有 4条记录-
菜学C++ Day56 OJ题目1190 对角线I
我的解法：直接是两个for循环当i==j的时候输出1 #include<iostream> #include<iomanip> using namespace std;int main() {int n;cin >> n;for (int i = 0; i < n; i++) {for (int j = 0; j < n; j++) {if (i == j)cout << setw(3) <<…
2021/11/26 17:10:53 人评论 次浏览 -
菜学C++ Day56 OJ题目1190 对角线I
我的解法：直接是两个for循环当i==j的时候输出1 #include<iostream> #include<iomanip> using namespace std;int main() {int n;cin >> n;for (int i = 0; i < n; i++) {for (int j = 0; j < n; j++) {if (i == j)cout << setw(3) <<…
2021/11/26 17:10:53 人评论 次浏览 -
[LeetCode] 1190. Reverse Substrings Between Each Pair of Parentheses 反转每对括号间的子串
You are given a string s that consists of lower case English letters and brackets. Reverse the strings in each pair of matching parentheses, starting from the innermost one. Your result should not contain any brackets. Example 1: Input: s = "(abc…
2021/8/15 6:05:45 人评论 次浏览 -
[LeetCode] 1190. Reverse Substrings Between Each Pair of Parentheses 反转每对括号间的子串
You are given a string s that consists of lower case English letters and brackets. Reverse the strings in each pair of matching parentheses, starting from the innermost one. Your result should not contain any brackets. Example 1: Input: s = "(abc…
2021/8/15 6:05:45 人评论 次浏览
