CarbonLee

分类

题解(6)

/ 注册

全部文章（共13篇）

题解 | #相助#

#include<bits/stdc++.h> using namespace std; int main(){ int n; cin>>n; if(n == 1){ cout<<-1; return 0; ...

C++

2024-05-31

0 268

题解 | #宝石#

#include<bits/stdc++.h> using namespace std; int main(){ int a; int b; cin>>a>>b; if(a * 2 < b){ cout<...

C++

2024-05-31

0 194

题解 | #回文串#

#include<bits/stdc++.h> using namespace std; int main(){ int len; int n; char c[200005]; cin>>len>>n; for(int i ...

C++

2024-05-31

0 205

题解 | #相遇#

#include<bits/stdc++.h> using namespace std; int main(){ int a; int b; cin>>a>>b; if(a == b) cout<<'p'; el...

C++

2024-05-31

1 213

题解 | #二分查找-I#

import java.util.*; public class Solution { /** * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可 * * * @param nums int整型一维数组 * ...

2024-05-29

0 196

题解 | #二分查找-I#

import java.util.*; public class Solution { int res = -1; /** * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可 * * * @param num...

2024-05-29

0 227

题解 | #单链表的排序#

import java.util.*; /* * public class ListNode { * int val; * ListNode next = null; * public ListNode(int val) { * this.val = val; * ...

2024-05-29

0 226

题解 | #二叉树的中序遍历#

import java.util.*; /* * public class TreeNode { * int val = 0; * TreeNode left = null; * TreeNode right = null; * public TreeNode(int v...

2024-05-28

0 207

题解 | #二叉树的后序遍历#

import java.util.*; /* * public class TreeNode { * int val = 0; * TreeNode left = null; * TreeNode right = null; * public TreeNode(int v...

2024-05-28

0 196

题解 | #二叉树的前序遍历#

import java.util.*; /* * public class TreeNode { * int val = 0; * TreeNode left = null; * TreeNode right = null; * public TreeNode(int v...

2024-05-28

0 187