Professional Documents
Culture Documents
head = head.GetNext();
Node<char> p = head;
p = p.GetNext();
p.SetNext(null);
return head;
head = head.GetNext();
Node<T> p = head;
p = p.GetNext();
p.SetNext(null);
return head;
l1 = l1.GetNext();
l2 = l2.GetNext();
return true;
return false;
Node<T> p = l1;
while (p.HasNext())
p = p.GetNext();
p.SetNext(l2);
return l1;
if (l1.GetValue().Equals(l2.GetValue()))
l2 = l2.GetNext();
l1 = l1.GetNext();
l2 = l2_copy;
return newList;
if (l1.GetValue().Equals(l2.GetValue()))
break;
l2 = l2.GetNext();
l1 = l1.GetNext();
l2 = l2_copy;
}
return newList;
Node<T> p;
while (head.HasNext())
p = head.GetNext();
while (p != null)
if (p.GetValue().Equals(head.GetValue()))
p = p.GetNext();
else
pre = pre.GetNext();
p = p.GetNext();
head = head.GetNext();
pre = head;
Node<int> p;
p = head.GetNext();
while (p != null)
if (p.GetValue() == head.GetValue())
p = p.GetNext();
else
pre = pre.GetNext();
p = p.GetNext();
head = head.GetNext();
pre = head;
Node<T> p;
while (head.HasNext())
p = head.GetNext();
if (max.GetValue().CompareTo(p.GetValue()) < 0)
max = p;
}
head = head.GetNext();
return max;
Node<int> p;
while (head.HasNext())
p = head.GetNext();
max = p;
head = head.GetNext();
return max;
Node<T> newHead;
if (l1.GetValue().CompareTo(l2.GetValue()) > 0)
newHead = l1;
l1 = l1.GetNext();
else
newHead = l2;
l2 = l2.GetNext();
}
if (l1.GetValue().CompareTo(l2.GetValue()) > 0)
tail.SetNext(l1);
l1 = l1.GetNext();
tail = tail.GetNext();
else
tail.SetNext(l2);
l2 = l2.GetNext();
tail = tail.GetNext();
tail.SetNext(l1);
tail.SetNext(l2);
return newHead;
Node<double> newHead;
if (l1.GetValue() > l2.GetValue())
newHead = l1;
l1 = l1.GetNext();
else
newHead = l2;
l2 = l2.GetNext();
tail.SetNext(l1);
l1 = l1.GetNext();
tail = tail.GetNext();
else
tail.SetNext(l2);
l2 = l2.GetNext();
tail = tail.GetNext();
tail.SetNext(l1);
}
else if (l2 != null)
tail.SetNext(l2);
return newHead;
arr[head.GetValue()]++;
head = head.GetNext();
int index = 0;
max = arr[i];
index = i;
return index;
Node<T> p1 = head;
Node<T> p2 = head.GetNext();
return false;
while (p2.HasNext())
p2 = p2.GetNext();
p1 = p1.GetNext();
return false;
return true;
Node<int> p1 = head;
Node<int> p2 = head.GetNext();
if (compare1 == 0)
return false;
while (p2.HasNext())
p2 = p2.GetNext();
p1 = p1.GetNext();
return false;
return true;
{
Node<T> head = l1;
l1 = l1.GetNext();
tail.SetNext(l2);
tail = l2;
tail.SetNext(l1);
tail = l1;
l2 = l2.GetNext();
l1 = l1.GetNext();
if (l1 != null)
tail.SetNext(l1);
tail.SetNext(l2);
return head;
L = L.GetNext();
while (L != null)
tail.SetValue(tail.GetValue() + L.GetValue());
else
{
tail.SetNext(new Node<int>(L.GetValue()));
tail = tail.GetNext();
pre = L.GetValue();
L = L.GetNext();
return head;
if (L == null)
return false;
int count = 0;
Node<int> p1 = L;
count++;
p1 = p1.GetNext();
if (count % 3 != 0)
return false;
p1 = L;
Node<int> p2 = L;
p1 = p1.GetNext();
p2 = p2.GetNext();
p2 = p2.GetNext();
}
for (int i = 0; i < count / 3; i++)
L = L.GetNext();
p1 = p1.GetNext();
p2 = p2.GetNext();
else
return false;
return true;
node.SetNext(L.GetNext());
L.SetNext(node);
node.SetValue(L.GetValue());
L.SetValue(n);
return;
Node<int> pre = L;
L = L.GetNext();
while (L != null)
if (n > L.GetValue())
{
pre = L;
L = L.GetNext();
else
pre.SetNext(node);
node.SetNext(L);
return;
L = L.GetNext();
while (L != null)
addSort(L, L.GetValue());
return head;
tail = tail.GetNext();
tail.SetNext(new Node<int>(-9));
tail = tail.GetNext();
lst = lst.GetNext();
num = lst.GetValue();
tail = tail.GetNext();
lst = lst.GetNext();
tail.SetNext(new Node<int>(-9));
tail = tail.GetNext();
return head;
tail = tail.GetNext();
lst = lst.GetNext();
tail.SetNext(new Node<int>(-9));
tail = tail.GetNext();
int max = 1;
int count = 1;
while (lst.HasNext())
lst = lst.GetNext();
count++;
max = count;
}
else
max = count;
count = 1;
num = lst.GetValue();
return max;
}
public static Node<double> Positive(Node<double> lst)
if (lst2.GetValue() > 0)
tail.SetNext(temp);
lst2 = lst2.GetNext();
PrintList(head);
PrintList(lst);
return head;