BJUT_bluecat的博客

在知乎上看见浙大查重被查了这道题，写了一下。面试常见的一道题。 原链表:head->1->2->3->null 方法：遍历一次，头插法重新排列。 head->null head->1->null .... head->3->2->1->null #include <iostream> #include &...

Given a list, rotate the list to the right by k places, where k is non-negative. Example: Given 1->2->3->4->5->NULL and k = 2, return 4->5->1->2->3->NULL. 此题题目描述不清 踩的很多/** * Definition for si

/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { val = x; } * } */ class Solution { public ListNode deleteDupli...

/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { val = x; } * } */ class Solution { public ListNode partition(L...

/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { val = x; } * } */ /** * Definition for a binary tree node. * pub...

解法：找一个代排序列，一个排好序列，然后一个个比较，插入正确位置，重要一点，没插入完一个元素要更新rear的next。Sort a linked list using insertion sort.A graphical example of insertion sort. The partial sorted list (black) initially contains only the fi...

Write a program to find the node at which the intersection of two singly linked lists begins.For example, the following two linked lists:A: a1 → a2 ↘ c...

class Node { public: int key_t; int value_t; Node(int key,int value):key_t(key),value_t(value) { } }; class LRUCache { public: list&lt;Node&gt; cache;//缓存 双向链表 方便插入...

#include <iostream> #include <memory> using namespace std; typedef struct LinkList { int val; shared_ptr<LinkList> next;//智能指针和普通指针不要混合使用 https://blog.youkuaiyun.com/flowing_wind/articl...