C# ListNode类代码示例

OStack程序员社区-中国程序员成长平台 › 门户 › 编程› c#›C#教程

原作者: [db:作者] 来自: [db:来源] 收藏邀请

本文整理汇总了C#中ListNode类的典型用法代码示例。如果您正苦于以下问题：C# ListNode类的具体用法？C# ListNode怎么用？C# ListNode使用的例子？那么恭喜您, 这里精选的类代码示例或许可以为您提供帮助。

ListNode类属于命名空间，在下文中一共展示了ListNode类的20个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于我们的系统推荐出更棒的C#代码示例。

示例1: RemoveNthFromEnd

 public ListNode<int> RemoveNthFromEnd(ListNode<int> head, int n)
 {
     // assume the input is always valid
     if (head.Next == null) // only 1 node
     {
         return null;
     }
     // reach that node first
     var tail = head;
     var preDelete = head;
     for (int i = 0; i < n; i++)
     {
         tail = tail.Next;
     }
     if (tail == null) // toDelete is head
     {
         return head.Next;
     }
     while (tail.Next != null)
     {
         tail = tail.Next;
         preDelete = preDelete.Next;
     }
     preDelete.Next = preDelete.Next.Next;
     return head;
 }

开发者ID:dullcat，项目名称:leetcode_csharp，代码行数:26，代码来源:Q019_RemoveNthNodeFromEndofList.cs

示例2: ReverseSingleSublistTest

        public void ReverseSingleSublistTest()
        {
            Func<ListNode<int>, int, int, ListNode<int>>[] functions = new Func<ListNode<int>, int, int, ListNode<int>>[]
            {
                ReverseSingleSublist.BruteForce,
                ReverseSingleSublist.SinglePass
            };

            for(int i = 0; i < 10; i++)
            {
                int[] data = ArrayUtilities.CreateRandomArray(10, 0, 10);
                for (int start = 1; start <= 10; start++)
                {
                    for(int end = start; end <= 10; end++)
                    {
                        ListNode<int>[] results = new ListNode<int>[functions.Length];

                        for (int j = 0; j < results.Length; j++)
                        {
                            ListNode<int> head = LinkedListUtilities.Initialize(data);
                            results[j] = functions[j](head, start, end);
                            Assert.IsTrue(LinkedListUtilities.AreEqual(results[0], results[j]));
                        }
                    }
                }
            }
        }

开发者ID:mmoroney，项目名称:Algorithms，代码行数:27，代码来源:ReverseSingleSublist.cs

示例3: AddTwoNumbers

 public ListNode AddTwoNumbers(ListNode l1, ListNode l2)
 {
     var add1=Convert(l1);
     var add2=Convert(l2);
     var res=add1+add2;
     return Convert(res);
 }

开发者ID:gaufung，项目名称:LeetCodeCSharp，代码行数:7，代码来源:002AddTwoNumbers.cs

示例4: MergeTwoLists

 //method to merge two sorted lists
 private ListNode MergeTwoLists(ListNode l1, ListNode l2){
     if(l1==null||l2==null){
         if(l1 ==null) return l2;
         if(l2 ==null) return l1;
     }
     ListNode newHead,p,p1,p2;
     if(l1.val < l2.val){
         newHead = l1;
          p1 = l1.next;
          p2 = l2;
     }
     else{
         newHead = l2;
          p1 = l1;
          p2 = l2.next;
     }
        
      p = newHead;
     while(p1!=null && p2!=null){
         if(p1.val < p2.val){
             p.next = p1;
             p1 = p1.next;
         }
         else{
             p.next = p2;
             p2 = p2.next;
         }
         p=p.next;
     }
     //no need to use the while loop, directly append p1 or p2 to p
     //because rest nodes of p1 or p2 are already sorted
     if(p1!=null) p.next=p1;
     if(p2!=null) p.next=p2;
     return newHead;
 }

开发者ID:siagung，项目名称:Qilu-leetcode，代码行数:36，代码来源:A178.MergeTwoUnsortedLists.cs

示例5: ReverseBetween

    public ListNode ReverseBetween(ListNode head, int m, int n)
    {
        var length = n-m +1;

        if(m == 1){
            ListNode tail;
            var h = ReverseList(head, length, out tail);
            head.next = tail;
            return h;
        }
        else{
            var c = 2;
            var t = head;
            while(c != m){
                t = t.next;
                c++;
            }

            ListNode tail;
            var h = ReverseList(t.next, length, out tail);
            t.next.next = tail;
            t.next = h;

            return head;
        }
    }

开发者ID:WillFr，项目名称:train，代码行数:26，代码来源:Solution.cs

示例6: ReverseBetween

 public ListNode ReverseBetween(ListNode head, int m, int n) {
     if(head==null) return null; //handle edge case
     ListNode preHead = new ListNode(0); 
     preHead.next = head;
     ListNode start = preHead; //start will be the (m-1)th node in the list
     //advance start pointer to the (m-1)th node in the list
     int count = 1;
     while(start!=null && count<m){
         start = start.next;
         count++;
     }
     
     if(count<m) return head; //length of the list is smaller than m, edge case
     //end is the mth node in the list
     ListNode end = start.next; //node will be inserted between start and end
     ListNode curr = end.next;//curr is the node to be insert 
     
     //insert each node right after start, advance curr until count==n
     while(curr!=null && count<n){
         ListNode next = curr.next; //get the next node using curr.next
         curr.next = start.next; //insert curr right after start node
         start.next = curr;
         end.next = next; //point end to next node
         curr = next; //advance curr to next node
         count++;
     }
     return preHead.next; //preHead is the node before original head, so return preHead.next
     
 }

开发者ID:siagung，项目名称:Qilu-leetcode，代码行数:29，代码来源:A113.ReverseLinkedListII.cs

示例7: Print

 private static void Print(ListNode n)
 {
     if(n != null){
         Console.Write(n.val);
         Print(n.next);
     }
 }

开发者ID:WillFr，项目名称:train，代码行数:7，代码来源:Solution2.cs

示例8: SwapPairs

        public ListNode<int> SwapPairs(ListNode<int> head)
        {
            if (head == null || head.Next == null)
            {
                return head;
            }
            ListNode<int> preResult = new ListNode<int>(-9999); // helper node
            var pre = preResult;
            var n1 = head;
            var n2 = head.Next;
            var post = n2.Next;
            while (true)
            {
                pre.Next = n2;
                n2.Next = n1;
                n1.Next = post;
                if (post == null || post.Next == null)
                {
                    break;
                }
                pre = n1;
                n1 = post;
                n2 = n1.Next;
                post = n2.Next;
            }

            return preResult.Next;
        }

开发者ID:dullcat，项目名称:leetcode_csharp，代码行数:28，代码来源:Q024_SwapNodesinPairs.cs

示例9: ReverseBetween

 public ListNode<int> ReverseBetween(ListNode<int> head, int m, int n)
 {
     if (m == n)
     {
         return head;
     }
     // find pre-changing head
     ListNode<int> dummy = new ListNode<int>(0);
     dummy.Next = head;
     var preChaningHead = dummy;
     int changeLength = n - m;
     while (m-- > 1)
     {
         preChaningHead = preChaningHead.Next;
     }
     var curNode = preChaningHead.Next;
     for (int i = 0; i < changeLength; i++)
     {
         var preNext = preChaningHead.Next;
         var curNext = curNode.Next;
         curNode.Next = curNext.Next;
         preChaningHead.Next = curNext;
         curNext.Next = preNext;
     }
     return dummy.Next;
 }

开发者ID:dullcat，项目名称:leetcode_csharp，代码行数:26，代码来源:Q092_ReverseLinkedListII.cs

示例10: AddTwoNumbers

        public ListNode<int> AddTwoNumbers(ListNode<int> l1, ListNode<int> l2)
        {
            ListNode<int> current = new ListNode<int>(-1);
            ListNode<int> head = current;

            int carry = 0;
            while (l1 != null || l2 != null || carry > 0)
            {
                int result = carry;
                if (l1 != null)
                {
                    result += l1.Val;
                    l1 = l1.Next;
                }
                if (l2 != null)
                {
                    result += l2.Val;
                    l2 = l2.Next;
                }

                current.Next = new ListNode<int>(result % 10);
                current = current.Next;
                carry = result / 10;
            }

            return head.Next;
        }

开发者ID:bluesteyes，项目名称:LeetSharp，代码行数:27，代码来源:Q002_AddTwoNumbers.cs

示例11: Partition

        public ListNode<int> Partition(ListNode<int> head, int x)
        {
            if (head == null)
                return null;

            ListNode<int> first = new ListNode<int>(-1);
            ListNode<int> second = new ListNode<int>(-1);
            ListNode<int> originalFirst = first;
            ListNode<int> originalSecond = second;

            while (head != null)
            {
                if (head.Val < x)
                {
                    first.Next = head;
                    first = first.Next;
                }
                else
                {
                    second.Next = head;
                    second = second.Next;
                }
                head = head.Next;
            }
            second.Next = null;
            first.Next = originalSecond.Next;

            return originalFirst.Next;
        }

开发者ID:bluesteyes，项目名称:LeetSharp，代码行数:29，代码来源:Q086_PartitionList.cs

示例12: AddTwoNumbers

 public ListNode<int> AddTwoNumbers(ListNode<int> l1, ListNode<int> l2)
 {
     // add l2 on to l1
     ListNode<int> current = new ListNode<int>(0);
     var answer = current;
     int toAdd = 0;
     while (true)
     {
         current.Val += toAdd;
         if (l1 != null)
         {
             current.Val += l1.Val;
             l1 = l1.Next;
         }
         if (l2 != null)
         {
             current.Val += l2.Val;
             l2 = l2.Next;
         }
         toAdd = current.Val / 10;
         current.Val = current.Val % 10;
         if (l1 != null || l2 != null || toAdd > 0)
         {
             current.Next = new ListNode<int>(0);
             current = current.Next;
         }
         else
         {
             break;
         }
     }
     return answer;
 }

开发者ID:dullcat，项目名称:leetcode_csharp，代码行数:33，代码来源:Q002_AddTwoNumbers.cs

示例13: Process

        public static ListNode Process(ListNode head, uint k)
        {
            if (head == null || k == 0)
            {
                return null;
            }

            ListNode ahead = head;
            for (int i = 0; i < k - 1; ++i)
            {
                if (ahead.Next != null)
                {
                    ahead = ahead.Next;
                }
                else
                {
                    return null;
                }
            }

            ListNode behind = head;
            while (ahead.Next != null)
            {
                ahead = ahead.Next;
                behind = behind.Next;
            }

            return behind;
        }

开发者ID:eriolchan，项目名称:problem，代码行数:29，代码来源:KthNodeFromEnd.cs

示例14: MergeKLists1

        public ListNode MergeKLists1(ListNode[] lists)
        {
            ListNode result = new ListNode(0);
            ListNode pointer = result;

            MinHeap mh = new MinHeap();
            foreach (ListNode node in lists)
            {
                if (node != null)
                {
                    mh.Add(node);
                }
            }

            while (mh.Count > 0)
            {
                ListNode node = mh.PopMin();
                if (node.next != null)
                {
                    mh.Add(node.next);
                }
                pointer.next = node;
                pointer = pointer.next;
            }

            return result.next;
        }

开发者ID:husthk986，项目名称:BlackSwan，代码行数:27，代码来源:_23MergedKSortedList.cs

示例15: Main

	public static void Main()
	{
		//test#1: null
		ListNode head = null;
		Solution.display(Solution.removeNodes(head,5)); //empty
		//test#2: 1
		head = new ListNode(1);
		Solution.display(Solution.removeNodes(head,5)); //1->
		//test#3: 5
		head = new ListNode(5);
		Solution.display(Solution.removeNodes(head,5)); //empty
		//test#4: 1->2
		head = new ListNode(1);
		head.next = new ListNode(2);
		Solution.display(Solution.removeNodes(head,5)); //1->2->
		//test#5: 5->5->5
		head = new ListNode(5);
		head.next = new ListNode(5);
		head.next.next = new ListNode(5);
		Solution.display(Solution.removeNodes(head,5)); //empty
		//test#6: 1->2->5->5
		head = new ListNode(1);
		head.next = new ListNode(2);
		head.next.next = new ListNode(5);
		head.next.next.next = new ListNode(5);
		Solution.display(Solution.removeNodes(head,5)); //1->2->
		//test#7: 1->2->5->5->3
		head = new ListNode(1);
		head.next = new ListNode(2);
		head.next.next = new ListNode(5);
		head.next.next.next = new ListNode(5);
		head.next.next.next.next = new ListNode(3);
		Solution.display(Solution.removeNodes(head,5)); //1->2->3->
	}

开发者ID:siagung，项目名称:Qilu-leetcode，代码行数:34，代码来源:A174.RemoveNodesWithValue.cs

示例16: MergeTwoLinkedList

        private ListNode MergeTwoLinkedList(ListNode node1, ListNode node2)
        {
            ListNode result = new ListNode(0);
            ListNode pointer = result;

            while (node1 != null && node2 != null)
            {
                if (node1.val < node2.val)
                {
                    pointer.next = node1;
                    node1 = node1.next;
                }
                else
                {
                    pointer.next = node2;
                    node2 = node2.next;
                }
                pointer = pointer.next;
            }

            while (node1 != null)
            {
                pointer.next = node1;
                node1 = node1.next;
                pointer = pointer.next;
            }
            while (node2 != null)
            {
                pointer.next = node2;
                node2 = node2.next;
                pointer = pointer.next;
            }

            return result.next;
        }

开发者ID:husthk986，项目名称:BlackSwan，代码行数:35，代码来源:_23MergedKSortedList.cs

示例17: RotateRight

        public ListNode<int> RotateRight(ListNode<int> head, int n)
        {
            if (head == null)
            {
                return null;
            }

            int totalLength = 1;
            ListNode<int> tail = head;
            while (tail.Next != null)
            {
                totalLength++;
                tail = tail.Next;
            }

            n %= totalLength;

            if (n == 0)
            {
                return head;
            }

            ListNode<int> p = head;
            for (int i = 0; i < totalLength - n - 1; i++)
            {
                p = p.Next;
            }

            ListNode<int> newHead = p.Next;
            p.Next = null;
            tail.Next = head;

            return newHead;
        }

开发者ID:bluesteyes，项目名称:LeetSharp，代码行数:34，代码来源:Q061_RotateList.cs

示例18: RotateRight

        public ListNode RotateRight(ListNode head, int k)
        {
            if (k <= 0 || head == null) { return head; }

            var ptr = new ListNode(-1);
            ptr.next = head;

            int lenght = 0;
            while (ptr.next != null)
            {
                ptr = ptr.next;
                lenght++;
            }
            ptr.next = head;

            var rest = lenght - k % lenght;
            for (int i = 0; i < rest; i++)
            {
                ptr = ptr.next;
            }

            head = ptr.next;
            ptr.next = null;
            return head;
        }

开发者ID:BigEgg，项目名称:LeetCode，代码行数:25，代码来源:061-RotateList.cs

示例19: InsertionSortList

 public ListNode InsertionSortList(ListNode head) {
     ListNode preHead = new ListNode(Int.MinValue);
     preHead.next = head;
     ListNode prev = null; //points to the node before curr
     ListNode curr = head;
     while(curr!=null){
         ListNode newPrev = curr; //if curr won't be moved, the prev for next pass
         ListNode newCurr = curr.next; //if curr won't be moved, the curr for next pass
         ListNode p = preHead;
         while(p.next!=curr){
             if(curr.val>=p.val && curr.val<=p.next.val){//curr needs ot be inserted between p and p.next
                 ListNode temp = curr.next; //store original curr.next
                 curr.next = p.next; //insert curr 
                 p.next = curr;
                 prev.next = temp; //after removing curr, needs to connect prev and original curr.next
                 newPrev = prev; //curr is moved so prev for next pass doesn't change
                 break;
             }
             p=p.next;
         }
         prev=newPrev; //if curr is not moved, prev won't change, otherwiese, prev points to curr
         curr=newCurr; //curr would always points to curr.next
     }
     return preHead.next;
 }

开发者ID:siagung，项目名称:Qilu-leetcode，代码行数:25，代码来源:A166.InsertionSortList.cs

示例20: DeleteNode

 public void DeleteNode(ListNode node)
 {
     if (node == null) return;
     node.val = node.next.val;
     node.next = node.next.next;
     return;
 }

开发者ID:einstenwolfgang，项目名称:leetcode-exercise，代码行数:7，代码来源:Delete+Node+in+a+Linked+List.cs

注：本文中的ListNode类示例整理自Github/MSDocs等源码及文档管理平台，相关代码片段筛选自各路编程大神贡献的开源项目，源码版权归原作者所有，传播和使用请参考对应项目的License；未经允许，请勿转载。

鲜花

握手

雷人

路过

鸡蛋

该文章已有0人参与评论

请发表评论

全部评论

专题导读

More+

10-27 六六分期app的软件客服如何联系？(六六分期

11-06 可心卡盟:win10系统火狐flash插件崩溃怎么

11-06 亲亲特价:怎么删除回收站图标

11-06 济南大学虚拟社区:鲁大师节能降温的具体办

11-06 xlueops.exe:无线网络安装向导

11-06 女斗合众国:win7系统cf与主机连接不稳定怎

11-06 0xc000022-[cf烟雾头]cf怎么调烟雾头

11-06 qizideyouhuo:应用程序无法正常启动0xc0000

11-06 ipz-185:win7系统vcf文件怎么打开

11-06 傻哥蹦迪:win10系统s4怎么打开usb调试

11-06 八神浩树gtaste:回收站清空了怎么恢复

11-06 妖尾之黑色守护:win10系统电脑没有1440x900

11-06 校园至尊魔王小说:win7系统浏览网页时字体

11-06 女斗合众国:win10系统访问共享文件夹提示请

11-06 tokyo hot n0654:恢复win7系统默认字体一招

11-06 雨酷仙境:设置win7系统转移临时文件夹腾出

11-06 阿穆纳伊之杖:win7系统开始菜单在右边还原

11-06 tunespotting:win10系统火狐flash插件总是

11-06 甘尔葛分析师：计谋网站seo关键词暴涨有什

11-06 蔡贵霖: 计谋网站seo关键词暴涨有什么秘密

11-06 博益网首页:ao3网页版进入不了解决方法

11-06 漏斗子专栏: 网站数据分析小白易懂精华篇

11-06 见证双虹怎么做:win7系统开启telnet命令的

11-06 颾狐蝶蜋:系统资源不足无法完成请求的服务

11-06 国光中学校歌:提交网站到alexa查询详细步骤

11-06 西安有情天:静态网页和动态网页的区别

11-06 红木雅尚斋:外部链接构造对网站的好处

11-06 前官礼遇：防止域名劫持–增强域安全性的10

11-06 密传二转答案: 中文分词算法有哪些

11-06 金泉家园邮编:百度快照劫持的表现及应对方

C# ListObject类代码示例发布时间：2022-05-24

C# ListJobsRequestMarshaller类代码示例发布时间：2022-05-24

剪的笔顺,诠释剪的笔画,认识剪的部首

1 六六分期app的软件客服如何联系？(六六分期

六六分期app的软件客服如何联系？不知道吗？加qq群【895510560】即可！标题：六六分期

阅读：19230|2023-10-27

2 可心卡盟:win10系统火狐flash插件崩溃怎么

今天小编告诉大家如何处理win10系统火狐flash插件总是崩溃的问题，可能很多用户都不知

阅读：9996|2022-11-06

3 亲亲特价:怎么删除回收站图标

今天小编告诉大家如何对win10系统删除桌面回收站图标进行设置，可能很多用户都不知道

阅读：8331|2022-11-06

4 济南大学虚拟社区:鲁大师节能降温的具体办

今天小编告诉大家如何对win10系统电脑设置节能降温的设置方法，想必大家都遇到过需要

阅读：8700|2022-11-06

5 xlueops.exe:无线网络安装向导

我们在使用xp系统的过程中,经常需要对xp系统无线网络安装向导设置进行设置，可能很多

阅读：8645|2022-11-06

6 女斗合众国:win7系统cf与主机连接不稳定怎

今天小编告诉大家如何处理win7系统玩cf老是与主机连接不稳定的问题，可能很多用户都不

阅读：9667|2022-11-06

7 0xc000022-[cf烟雾头]cf怎么调烟雾头

电脑对日常生活的重要性小编就不多说了，可是一旦碰到win7系统设置cf烟雾头的问题，很

阅读：8630|2022-11-06

8 qizideyouhuo:应用程序无法正常启动0xc0000

我们在日常使用电脑的时候，有的小伙伴们可能在打开应用的时候会遇见提示应用程序无法

阅读：8004|2022-11-06

9 ipz-185:win7系统vcf文件怎么打开

今天小编告诉大家如何对win7系统打开vcf文件进行设置，可能很多用户都不知道怎么对win

阅读：8664|2022-11-06

10 傻哥蹦迪:win10系统s4怎么打开usb调试

今天小编告诉大家如何对win10系统s4开启USB调试模式进行设置，可能很多用户都不知道怎

阅读：7540|2022-11-06

客服电话

电子邮件

C# ListNode类代码示例

示例1: RemoveNthFromEnd

示例2: ReverseSingleSublistTest

示例3: AddTwoNumbers

示例4: MergeTwoLists

示例5: ReverseBetween

示例6: ReverseBetween

示例7: Print

示例8: SwapPairs

示例9: ReverseBetween

示例10: AddTwoNumbers

示例11: Partition

示例12: AddTwoNumbers

示例13: Process

示例14: MergeKLists1

示例15: Main

示例16: MergeTwoLinkedList

示例17: RotateRight

示例18: RotateRight

示例19: InsertionSortList

示例20: DeleteNode

请发表评论

全部评论

上一篇：

下一篇：

krishnaik06/Machine-Learning-in-90-days

jacoco/jacoco: Java Code Coverage Librar

joaomh/curso-de-matlab

美元符号为什么是“$”

andrew-waters/SASS-Material-Design-for-B

剪的笔顺,诠释剪的笔画,认识剪的部首

六六分期app的软件客服如何联系？(六六分期

florent37/ViewAnimator: A fluent Android

florent37/Shrine-MaterialDesign2: implem

CVE-2020-36276

SimpleSoftwareIO/simple-sms: Send and re

关于我们

产品与服务

解决方案

139-2527-9053