Add two numbers for leetcode

最新推荐文章于 2024-08-12 10:14:14 发布

fyifei0558

最新推荐文章于 2024-08-12 10:14:14 发布

阅读量156

点赞数

CC 4.0 BY-SA版权

分类专栏：杂文文章标签： leetcode 动态规划链表

本文链接：https://blog.csdn.net/fyifei0558/article/details/122078861

杂文专栏收录该内容

44 篇文章

订阅专栏

本文介绍了使用链表数据结构实现两个数相加的方法，包括递归方式和迭代方式。通过定义链表节点结构，利用两种不同的算法实现链表相加，并展示了具体的代码实现。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

no more words, see codes:

using System;

namespace ConsoleApp10
{
    class Program
    {
        public class Node
        {
            public int data;
            public Node next;
        }

        //approach1: recursive
        public static void AddTwoNumbers(Node header, Node cur, Node p1, Node p2, int carray)
        {
            if (p1 == null && p2 == null)
            {
                if (carray != 0)
                {
                    if (cur == null)
                    {
                        cur = new Node();
                    }
                    else
                    {
                        cur.next = new Node();
                        cur = cur.next;
                    }

                    cur.data = carray;
                }

                return;
            }

            int l1 = 0;
            int l2 = 0;
            if (p1 != null)
            {
                l1 = p1.data;
                p1 = p1.next;
            }

            if (p2 != null)
            {
                l2 = p2.data;
                p2 = p2.next;
            }

            int sum = l1 + l2 + carray;
            carray = sum /10;

            if (cur == null)
            {
                cur = new Node();
            }
            else
            {
                cur.next = new Node();
                cur = cur.next;
            }

            cur.data = sum - carray * 10;

            if (header == null)
            {
                header = cur;
            }

            AddTwoNumbers(header, cur, p1, p2, carray);
        }

        //approach2:
        public static Node GetList(Node p1, Node p2)
        {
            Node header = null;
            int carry = 0;
            Node curr = null;
            while (p1 != null || p2 != null)
            {
                Node temp = new Node();
                if (header == null)
                {
                    header = temp;
                }

                if(curr == null)
                {
                    curr = temp;
                }
                else
                {
                    curr.next = temp;
                    curr = curr.next;
                }

                int l1 = 0;
                int l2 = 0;
                if (p1 != null)
                {
                    l1 = p1.data;
                    p1 = p1.next;
                }

                if (p2 != null)
                {
                    l2 = p2.data;
                    p2 = p2.next;
                }

                int sum = l1 + l2 + carry;
                carry = sum / 10;
                temp.data = sum - carry * 10;
            }

            if (carry != 0)
            {
                Node temp = new Node();
                temp.data = carry;

                curr.next = temp;

            }

            return header;
        }

        static void Main(string[] args)
        {
            Console.WriteLine("Hello World!");
            Node l1 = new Node();
            l1.data = 3;
            Node l2 = new Node();
            l2.data = 8;
            Node l3 = new Node();
            l3.data = 9;
            l1.next = l2;
            l2.next = l3;

            Node l11 = new Node();
            l11.data = 3;
            Node l21 = new Node();
            l21.data = 8;
            l11.next = l21;

            Node header = null;
            Node cur = null;
          
            AddTwoNumbers(header, cur, l1, l11, 0);

            var cc = GetList(l1, l11);



        }
    }
}