Object Array List

最新推荐文章于 2025-09-09 11:31:15 发布

原创最新推荐文章于 2025-09-09 11:31:15 发布 · 274 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#object #insert #list #null #class #each

C++ 专栏收录该内容

4 篇文章

订阅专栏

本文详细介绍了如何利用C++编程语言，通过设计特定的节点类和对象列表类，实现对象数组与链表之间的高效数据存储与遍历操作。重点在于展示了插入、显示等关键功能的实现过程，为开发者提供了实用的编程技巧。

In order to store an object array and for each array element is a head of another class linked list

C++ version.

#include <iostream>
#define MAXH 10;
using namespace std;

class Node {
public:
	int value;
	Node() {
		value = 0;
	}
	Node(int value) {
		this->value = value;
	}
	Node(Node &n) {
		this->value = n.value;
	}
};

class objectList {
public:
	Node node;
	objectList *next;

	objectList() {
	}

	objectList(Node newNode) {
		node = newNode;
		next = NULL;
	}
};

objectList list[10];

void insert(Node &newNode, int level) {
	objectList *pList = &list[level];
	objectList *qList = new objectList(newNode);
	while(pList->next != NULL) {
		pList = pList->next;
	}
	pList->next = qList;
}

void display(objectList *pList, int level) {
	cout << "==================" << endl;
	objectList *tmp = pList+level;
	while(tmp != NULL) {
		cout << tmp->node.value << "\t->\t";
		tmp = tmp->next;
	}
	cout << endl;
	cout << "==================" << endl;
}

int main() {
	Node newNode1(1);
	Node newNode2(2);
	Node newNode3(3);
	
	insert(newNode1, 0);
	insert(newNode2, 0);
	insert(newNode3, 2);
	display(list, 2);
	return 0;
}