LeetCode:Sort List
leetcode 之Remove Duplicates from Sorted List（17）
很简单的一题，需要注意的是如果某结点重复了记得将其删除。 ListNode *deleteDuplicates(ListNode *head) { if (head == nullptr) return nullptr; ListNode *prev = head; for (ListNo
日期 2023-06-12 10:48:40
（LeetCode 21）Merge Two Sorted Lists
Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists. 题目要求： 合并两个有序链表 注意： 不能开辟新的结点空间 解题思路： 1、归并排序，创建一个新的头结点，从头到尾
日期 2023-06-12 10:48:40
(LeetCode 82)Remove Duplicates from Sorted List II
Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list. For example,Given 1->2->3->3->4->4->5, return 1->2
日期 2023-06-12 10:48:40![[LeetCode] Insertion Sort List](/scriptcss/images/65.png)
[LeetCode] Insertion Sort List
解题思路 对于得到结点current的插入位置，从头结点开始遍历，直到遍历到值大于等于节点current的结点，然后将从该结点到current的前驱结点的所有结点的值依次和current结点的值交换，从而达到将该节点插入所遍历到的位置的目的。 /**************** 解题思路 对于得到结点current的插入位置，从头结点开始遍历，直到遍历到值大于等于节点current的结
日期 2023-06-12 10:48:40
leetCode 82.Remove Duplicates from Sorted List II （删除排序链表的反复II） 解题思路和方法
Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list. For example, Given 1->2->3->3->4->4-
日期 2023-06-12 10:48:40LeetCode - Sort List
就是用List来实现merge sort. import java.io.*; import java.util.*; class ListNode { int val; ListNode next; ListNode(int x) { val = x; next = null; } s
日期 2023-06-12 10:48:40[LeetCode] 83. Remove Duplicates from Sorted List ☆(从有序链表中删除重复项)
描述 Given a sorted linked list, delete all duplicates such that each element appear only once. Example 1: Input: 1->1->2Output: 1->2Example 2: Input: 1->1->2->3->3Output: 1->2-
日期 2023-06-12 10:48:40[LeetCode] 23. Merge k Sorted Lists ☆☆☆☆☆
转载:https://leetcode.windliang.cc/leetCode-23-Merge-k-Sorted-Lists.html 描述 Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity. Example: Input:[ 1
日期 2023-06-12 10:48:40Leetcode - Insertion Sort List
It is quite a basic problem. However I spent half an hour solving it and made two mistakes. Guess it's because I haven't written some fundamental data structures like linked list for a
日期 2023-06-12 10:48:40LeetCode之Sort List
称号：Sort a linked list in O(n log n) time using constant space complexity. 对一个单链表进行排序，要求时间复杂度为O(n log&n
日期 2023-06-12 10:48:40leetcode 21. Merge Two Sorted Lists
Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists. Example: Input: 1->2->4, 1->3->4 Output: 1-
日期 2023-06-12 10:48:40LeetCode 83:Remove Duplicates from Sorted List
Given a sorted linked list, delete all duplicates such that each element appear only once. For example, Given 1->1->2, return 1->2. Given 1->1->2->3->3, r
日期 2023-06-12 10:48:40[LeetCode] Remove Duplicates from Sorted List II
Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list. For example,Given 1->2->3->3->4->4-&
日期 2023-06-12 10:48:40【LeetCode】82. Remove Duplicates from Sorted List II
Remove Duplicates from Sorted List II Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list. For example,Given
日期 2023-06-12 10:48:40待字闺中之快排单向链表；leetcode之Sort List
题目来源。待字闺中。原创@陈利人 。欢迎大家继续关注微信公众账号“待字闺中” 分析：思路和数据的高速排序一样，都须要找到一个pivot元素、或者节点。然后将数组或者单向链表划分为两个部分。然后递归分别快排。 针对数组进行快排的时候，交换交换不同位置的数值。在分而治之完毕之后，数据就是排序好的。那么单向链表是什么样的情况呢？除了交换节点值之外。是否有其它更好的方法呢？能够改动指针，不进行数值
日期 2023-06-12 10:48:40[LeetCode] 708. Insert into a Cyclic Sorted List 在循环有序的链表中插入结点
Given a node from a Circular Linked List which is sorted in ascending order, write a function to insert a value insertVal into the list such that it remains a sor
日期 2023-06-12 10:48:40[LeetCode] Convert Sorted List to Binary Search Tree 将有序链表转为二叉搜索树
Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST. For this problem, a height-balanced binary tree is defined as a binary tree in whi
日期 2023-06-12 10:48:40[LeetCode] 82. Remove Duplicates from Sorted List II 移除有序链表中的重复项之二
Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list. Example 1: Input: 1->2->3->3->4->4->
日期 2023-06-12 10:48:40Leetcode——21. Merge Two Sorted Lists
1. 概述 1.1 题目 Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists. 1.2 解题思路 在这道题中需要将两个
日期 2023-06-12 10:48:40leetcode 21. Merge Two Sorted Lists 合并两个有序链表(简单)
一、题目大意 将两个升序链表合并为一个新的 升序 链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。 示例 1： 输入：l1 = [1,2,4], l2 =
日期 2023-06-12 10:48:40