package main

import (
	"./correct"
	"github.com/01-edu/public/go/lib"
)

type stuNode = NodeAddL
type solNode = correct.NodeAddL

func stuPushFront(node *stuNode, num int) *stuNode {
	tmp := &stuNode{Num: num}
	tmp.Next = node
	return tmp
}

func stuNumToList(num int) *stuNode {
	var res *stuNode
	for num > 0 {
		res = stuPushFront(res, num%10)
		num /= 10
	}
	return res
}

func stuListToNum(node *stuNode) int {
	var n int

	for tmp := node; tmp != nil; tmp = tmp.Next {
		n = n*10 + tmp.Num
	}
	return n
}

func solPushFront(node *solNode, num int) *solNode {
	tmp := &solNode{Num: num}
	tmp.Next = node
	return tmp
}

func solNumToList(num int) *solNode {
	var res *solNode
	for num > 0 {
		res = solPushFront(res, num%10)
		num /= 10
	}
	return res
}

func solListToNum(node *solNode) int {
	var n int

	for tmp := node; tmp != nil; tmp = tmp.Next {
		n = n*10 + tmp.Num
	}
	return n
}

func compareNodes(stuResult *stuNode, solResult *solNode, num1 int) {
	if stuResult == nil && solResult == nil {
		return
	}
	if stuResult != nil && solResult == nil {
		stuNum := stuListToNum(stuResult)
		lib.Fatalf("\nSortll(%d) == %v instead of %v\n\n",
			num1, stuNum, "")
	}
	if stuResult == nil && solResult != nil {
		solNum := solListToNum(solResult)
		lib.Fatalf("\nSortll(%d) == %v instead of %v\n\n",
			num1, "", solNum)
	}
	stuNum := stuListToNum(stuResult)
	solNum := solListToNum(solResult)
	if stuNum != solNum {
		lib.Fatalf("\nSortll(%d) == %v instead of %v\n\n",
			num1, stuNum, solNum)
	}
}

func main() {
	table := []int{123456}
	table = append(table, lib.MultRandIntBetween(0, 1000000000)...)
	for _, arg := range table {
		stuResult := Sortll(stuNumToList(arg))
		solResult := correct.Sortll(solNumToList(arg))

		compareNodes(stuResult, solResult, arg)
	}
}