当前位置：首页 > news >正文

链表中出现的问题

news 2025/11/15 18:27:39

代码

#include<iostream>
#include<stdexcept>
using namespace std;
#define eleType int
//节点的实现
struct listNode {eleType data;listNode* next;//数据域这里错了，初始化一直是0啊，无法改变//listNode(eleType x):data(0),next(NULL){}listNode(eleType x) :data(x), next(NULL) {}
};
//链表类：增删改查
class linkedList {
private:listNode* head;int size;
public:linkedList():head(NULL),size(0){}//这里由于实例化对象调用的是默认构造函数，所以第一个小括号里面不应该有参数//插入函数声明void insert(eleType value,int i);//删除函数声明void remove(int i);//查找函数声明listNode* find(eleType value);listNode* get(int i);//修改函数声明void update(eleType value, int i);//调试函数声明void print();~linkedList();
};
//析构函数->问题4
linkedList::~linkedList() {listNode* curr = head;while (curr) {listNode* temp = curr;curr = curr->next;delete temp;}
}
//插入函数
void linkedList::insert(eleType value,int i) {if (i<0 || i>size) {throw out_of_range("Invalid Position!");//问题1}listNode* newCode = new listNode(value);//问题2if (i == 0) {
//		listNode* curr = head;//这个指针多余了newCode->next = head;head = newCode;}else {listNode* curr = head;for (int j = 0; j < i - 1; j++) {curr = curr->next;}newCode->next = curr->next;curr->next = newCode;}size++;
}
//删除函数
void linkedList::remove(int i) {if (i<0 || i>size) {throw out_of_range("Invalid Position!");}if (i == 0) {listNode* curr = head;head = curr->next;delete curr;}else {listNode* curr = head;for (int j = 0; j < i - 1; j++) {curr = curr->next;}listNode* temp = curr->next;curr->next = temp->next;delete temp;}size--;
}
//查找函数
listNode* linkedList::find(eleType value) {//给值传数listNode* curr = head;while (curr && curr->data != value) {curr = curr->next;}return curr;
}
listNode* linkedList::get(int i) {//给数传值if (i<0 || i>size) {throw out_of_range("Invalid Position!");}listNode* curr = head;for (int j = 0; j < i; j++) {curr = curr->next;}return curr;
}
void linkedList::update(eleType value, int i) {if (i<0 || i>size) {throw out_of_range("Invalid Position!");}listNode* curr = head;for (int j = 0; j < i; j++) {curr = curr->next;}curr->data = value;
}
void linkedList::print() {listNode* curr = head;while (curr) {cout << curr->data << ' ';curr = curr->next;//这里要偏移指针遍历链表啊}cout << endl;
}
int main() {linkedList list;//问题3list.insert(10, 0);list.insert(20, 1);list.insert(30, 2);list.insert(40, 3);list.insert(50, 4);list.print();list.remove(0);list.print();list.update(666, 0);list.print();listNode* const temp = list.find(666);cout << temp->data << endl;cout << list.get(0)->data << endl;return 0;
}