c_cpp WIP：IntList副本分配

Posted 2021-05-14

if(!(this->first)){
		this->first = nullptr;
	}
	if(!(source.first)){
		this->first = nullptr;
	}
	Node *s = source.first;
	Node *d = this->first;
	Node *o;
	while(s && d){
		d->info = s->info;
		cout<<d->next<<endl;
		cout<<s->next<<endl;
		if(!(s->next) && d->next){
			o = d->next;
			d->next = nullptr;
			//break;
		}
		s = s->next;
		d = d->next;
	}

	//if the destination LinkedList is longer than the source LinkedList
	if(!s && o){
		// IntList list;
		// list.first = d;
		// this->removeRest(list);
		while(o){
			Node *next = o->next;
			delete o;
			o = next;
		}
	}
	//if the source LinkedList is longer than the destination LinkedList
	else if(s && !d){
		while(s){
			this->append(s->info);
			s = s->next;
		}
	}

	return *this;