两个有序链表合并 java_java 创建方法合并两个有序链表成一个新的有序链表 代码...

请问如何创建“publicstaticSortedListmergeList(SortedListlist1,SortedListlist2)”方法，该方法可以合并两个有序链表成为一个新的有序链表。程序应该遍历每个链表的元素然后直接把...

请问如何创建“public static SortedList mergeList(SortedList list1, SortedList list2)”方法

，该方法可以合并两个有序链表成为一个新的有序链表。程序应该遍历每个链表的元素然后直接把他们链接成一个新的有序的链表‘This method can merge two sorted lists into a new sorted one,

and return a reference of the new list.The program should go through each link item in both lists,and directly link them into the new list in order.“

多谢帮忙！

now I have

class Link

{

public long dData;

public Link next;

public Link(long dd)

{ dData = dd; }

public void displayLink()

{ System.out.print(dData + ” “); }

} // end class Link

class SortedList

{

public Link first;

public SortedList()

{ first = null; }

public boolean isEmpty()

{ return (first==null); }

public void insert(long key)

{

Link newLink = new Link(key);

Link previous = null;

Link current = first;

// until end of list,

while(current != null && key > current.dData)

{ // or key > current,

previous = current;

current = current.next;

}

if(previous==null)

first = newLink;

else // not at beginning

previous.next = newLink;

newLink.next = current;

} // end insert()

//————————————————————-

public Link remove()

{

Link temp = first;

first = first.next;

return temp;

}

public void displayList()

{

System.out.print(“List (first–>last): “);

Link current = first; // start at beginning of list

while(current != null) // until end of list,

{

current.displayLink(); // print data

current = current.next; // move to next link

}

System.out.println(“”);

}

//public static SortedList mergeList(SortedList list1, SortedList list2){

//

//}

}

展开