三木orz

分类

经验总结(2) 题解(20)

/ 注册

全部文章（共43篇）

题解 | #链表相加(二)#

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

2023-07-24

0 329

题解 | #两个链表的第一个公共结点#

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

2023-07-24

0 330

题解 | #删除链表的倒数第n个节点#

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

2023-07-24

0 290

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

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

2023-07-24

0 253

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

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

2023-07-23

0 285

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

import java.util.*; /** * Definition for singly-linked list. * class ListNode { * int val; * ListNode next; * ListNode(int x) { * ...

2023-07-23

0 266

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

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

2023-07-23

0 257

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

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

2023-07-23

0 260

题解 | #链表中的节点每k个一组翻转#

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

2023-07-23

0 294

题解 | #最小的K个数#

class Solution { public: vector<int> GetLeastNumbers_Solution(vector<int> input, int ...

2022-09-06

0 323