-
Notifications
You must be signed in to change notification settings - Fork 0
/
common-listnode.cs
77 lines (65 loc) · 1.96 KB
/
common-listnode.cs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
using System;
using System.Text;
using System.Linq;
using System.Collections.Generic;
namespace Common
{
public class ListNodeHelper
{
public static ListNode BuildList(string arrStr) => BuildList(ArrayHelper.ArrayFromString<int>(arrStr));
public static ListNode BuildList(int[] arr)
{
ListNode node = null;
for(int i=arr.Length-1; i>=0; i--)
node = new ListNode(arr[i], node);
return node;
}
public static ListNode[] BuildListArray(string arrStr)
{
var arr = ArrayHelper.MatrixFromString<int>(arrStr);
var res = new ListNode[arr.Length];
for(int i=0; i<res.Length; i++)
res[i] = BuildList(arr[i]);
return res;
}
public static bool AreEqual(ListNode list1, ListNode list2)
{
while(list1 != null && list2 != null)
{
if(list1.val != list2.val)
return false;
list1 = list1.next;
list2 = list2.next;
}
return list1 == null && list2 == null;
}
public static bool AreEqual(ListNode[] list1, ListNode[] list2)
{
if(list1.Length != list2.Length)
return false;
for(int i=0; i<list1.Length; i++)
if(!AreEqual(list1[i], list2[i]))
return false;
return true;
}
public static ListNode Tail(ListNode head)
{
var curr = head;
while(curr?.next != null)
{
curr = curr.next;
}
return curr;
}
}
public class ListNode
{
public int val;
public ListNode next;
public ListNode(int val = 0, ListNode next = null)
{
this.val = val;
this.next = next;
}
}
}