public/subjects/addlinkednumbers/README.md

addlinkednumbers

Instructions

You have two numbers represented by a linked list, where each NodeAddL contains a single digit. The digits are stored in reverse order, such that the 1’s digit is at the head of the list. Write a function that adds the two numbers and returns the sum as a linked list

Expected function and structure

package main

type NodeAddL struct {
	Next *NodeAddL
	Num  int
}

func AddLinkedNumbers(num1, num2 *NodeAddL) *NodeAddL {

}

Usage

Here is a possible program to test your function:

package main

import "fmt"

func pushFront(node *NodeAddL, num int) *NodeAddL {

}

func main() {
	// 3 -> 1 -> 5
	num1 := &NodeAddL{Num:5}
	num1 = pushFront(num1, 1)
	num1 = pushFront(num1, 3)

	// 5 -> 9 -> 2
	num2 := &NodeAddL{Num:2}
	num2 = pushFront(num2, 9)
	num2 = pushFront(num2, 5)

	// 9 -> 0 -> 7
	result := AddLinkedNumbers(num1, num2)
	for tmp := result; tmp != nil; tmp = tmp.Next {
		fmt.Print(tmp.Num)
		if tmp.Next != nil {
			fmt.Print(" -> ")
		}
	}
	fmt.Println()
}

An its output:

student@ubuntu:~/[[ROOT]]/test$ go build
student@ubuntu:~/[[ROOT]]/test$ ./main
9 -> 0 -> 7
student@ubuntu:~/[[ROOT]]/test$