25. Reverse Nodes in k-Group
2021/11/4 22:16:26
本文主要是介绍25. Reverse Nodes in k-Group,对大家解决编程问题具有一定的参考价值,需要的程序猿们随着小编来一起学习吧!
SLinkedList<int> slist = new SLinkedList<int>(); slist.AppendRange(new[] { 1, 2, 3, 4, 5 }); Console.WriteLine("Input: " + slist.Print()); Console.WriteLine("k = 2"); var rslt = slist.ReverseKGroup(2); Console.WriteLine("Output:" + rslt.Print()); Console.WriteLine("k = 3"); rslt = slist.ReverseKGroup(3); Console.WriteLine("Output:" + rslt.Print());
/// <summary> /// k 个相邻的元素,翻转链表,多余的继续保持 /// </summary> /// <typeparam name="T"></typeparam> /// <param name="source"></param> /// <param name="k"></param> /// <returns></returns> public static SLinkedList<T> ReverseKGroup<T>(this SLinkedList<T> source, int k) where T : IComparable<T> { var tmp = new SLinkedList<T>(source); var node = ReverseKGroupImp(tmp.Head, k); return new SLinkedList<T>(node); } private static SLinkedListNode<T> ReverseKGroupImp<T>(SLinkedListNode<T> head, int k) where T : IComparable<T> { var node = head; for (int i = 0; i < k; i++) { if (node == null) { return head; } node = node.Next; } var newHead = Reverse(head, node); head.Next = ReverseKGroupImp(node, k); return newHead; } private static SLinkedListNode<T> Reverse<T>(SLinkedListNode<T> first, SLinkedListNode<T> last) where T : IComparable<T> { var prev = last; while (first != last) { var tmp = first.Next; first.Next = prev; prev = first; first = tmp; } return prev; }
这篇关于25. Reverse Nodes in k-Group的文章就介绍到这儿,希望我们推荐的文章对大家有所帮助,也希望大家多多支持为之网!
- 2024-10-01基于Python+Vue开发的医院门诊预约挂号系统
- 2024-10-01基于Python+Vue开发的旅游景区管理系统
- 2024-10-01RestfulAPI入门指南:打造简单易懂的API接口
- 2024-10-01初学者指南:了解和使用Server Action
- 2024-10-01Server Component入门指南:搭建与配置详解
- 2024-10-01React 中使用 useRequest 实现数据请求
- 2024-10-01使用 golang 将ETH账户的资产平均分散到其他账户
- 2024-10-01JWT用户校验课程:从入门到实践
- 2024-10-01Server Component课程入门指南
- 2024-09-30Dnd-Kit学习:新手快速入门指南