ddd

分类

/ 注册

全部文章（共91篇）

题解 | #复杂链表的复制#

# -*- coding:utf-8 -*- # class RandomListNode: # def __init__(self, x): # self.label = x # self.next = None # self.random ...

2023-10-15

0 154

题解 | #链表中倒数最后k个结点#

# class ListNode: # def __init__(self, x): # self.val = x # self.next = None # # 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可 # # # @para...

2023-10-15

0 215

题解 | #链表中环的入口结点#

import re # -*- coding:utf-8 -*- # class ListNode: # def __init__(self, x): # self.val = x # self.next = None # class Solution: # ...

2023-10-15

0 253

题解 | #判断链表中是否有环#

import re # def __init__(self, x): # self.val = x # self.next = None # # # @param head ListNode类 # @return bool布尔型 # class Solu...

2023-10-15

0 198

题解 | #链表内指定区间反转#

from dataclasses import FrozenInstanceError # class ListNode: # def __init__(self, x): # self.val = x # self.next = None # # 代码中的类...

2023-10-09

0 226

题解 | #从尾到头打印链表#

# -*- coding:utf-8 -*- # class ListNode: # def __init__(self, x): # self.val = x # self.next = None # # 代码中的类名、方法名、参数名已经指定，请勿修改，直接...

2023-10-07

0 293

题解 | #求最大最小数#

#include <iostream> #include <vector> #include <algorithm> using namespace std; int main() { int a; vector<int> v; ...

2023-03-30

0 238

题解 | #反序输出#

#include <string> #include <iostream> #include <algorithm> #include <vector> using namespace std; int main() { string str...

2023-03-30

0 256

题解 | #特殊乘法#

#include <iostream> #include <string> using namespace std; int main(){ string str1, str2; cin >> str1 >> str2; int...

2023-03-27

0 292

题解 | #n的阶乘#

#include <iostream> using namespace std; int main() { int a; while (cin >> a ) { // 注意 while 处理多个 case long long ans = 1;/...

2023-03-27

0 185