周荣i

分类

/ 注册

全部文章（共18篇）

题解 | 二维斐波那契数列

x = input().split(" ") n, m = int(x[0]), int(x[1]) dp = [[0] * (m + 1) for _ in range(n + 1)] # 初始化二维数组 dp[1][1] = 1 for i in range(2, n + ...

2025-05-28

0 29

题解 | 牛牛学数列6

n = int(input()) dp = [0] * (n + 1) dp[1] = 0 dp[2] = 1 dp[3] = 1 for i in range(4, n + 1): dp[i] = dp[i - 1] + 2 * dp[i - 2] + dp[i - 3] print...

2025-05-28

0 20

题解 | 疫情死亡率

x = input().split(" ") ans = float((int)(x[1]) / (int)(x[0]))*100 print("{:.3f}%".format(ans))

2025-05-27

0 38

题解 | #中缀表达式转后缀表达式#

#include <stdio.h> #include<malloc.h> #include <string.h> typedef struct Stack { char* val; int size; int capacity; }Sta...

2023-11-24

0 311

题解 | #牛群编号的回文顺序#

思路：将链表从中间反转后，从两头往中间走边走边判断是否回文，且处理奇数个节点的特殊情况即可 import java.util.*; /* * public class ListNode { * int val; * ListNode next = null; * public ...

2023-09-17

0 192

题解 | #类似将链表以某个值分开#

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

2023-09-17

0 290

题解 | #链表排序----归并排序思想#

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

2023-09-17

0 243

题解 | #合并k个已排序的链表#

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

2023-09-16

0 266

题解 | #牛群的合并#

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

2023-09-16

0 229

题解 | #牛群旋转#

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

2023-09-16

0 270