public SinglyList<T> merge(SinglyList<T > list){ Node<T> p = head.next; Node<T> q = list.head.next; Node<T> succ; Node<T> succ2; while(p!=null&&q!=null){ if (p.data.compareTo(q.data)>0){ // succ2 = q.next; q.next = p; head.next = q; // p = q; // q = succ2; // head.next = new Node<T>(q.data,head.next); head = head.next; }else if(p.data.compareTo(q.data)<0){ succ = q.next; q.next = p.next; p.next = q; p = q; q = succ; // p.next = new Node<T>(q.data,p.next); p = p.next; }else { p = p.next; q = q.next; } } return this; }
Merge(SinglyList 《合并》)
最新推荐文章于 2022-09-13 23:50:14 发布