周荣i

分类

/ 注册

全部文章（共15篇）

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

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

2023-11-24

0 155

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

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

2023-09-17

0 94

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

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

2023-09-17

0 139

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

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

2023-09-17

0 110

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

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

2023-09-16

0 127

题解 | #牛群的合并#

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

2023-09-16

0 102

题解 | #牛群旋转#

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

2023-09-16

0 128

题解 | #牛群分隔#

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

2023-09-16

0 102

题解 | #合并两个有序链表#

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

2023-09-16

0 83

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

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

2023-09-15

0 104