算法之顺序查找法

最新推荐文章于 2023-12-19 21:08:19 发布

Claire_wulian

最新推荐文章于 2023-12-19 21:08:19 发布

阅读量188

点赞数

分类专栏：每日一贴 C++求职贴文章标签：链表算法

本文链接：https://blog.csdn.net/weixin_42388255/article/details/103567645

版权

本文介绍了如何使用链表数据结构进行顺序查找操作，详细阐述了通过链表指针进行查找的过程。

摘要由CSDN通过智能技术生成

顺序查找发：采用链表指针来查找

template<typename Key, typename Value>
class SequenceST {
private:
	struct Node {
		Key key;
		Value value;
		Node* next;
		Node(Key key, Value value) {
			this->key = key;
			this->value = value;
			this->next = NULL;
		}
	};
	Node* head;
	int count;
public:
	SequenceST() {	
		head = NULL;
		count = 0;
	}
	~SequenceST()
	{
		while (head != NULL) {
			Node *node = head;
			head = head->next;
			delete node;
			count--;
		}
		assert(head == NULL && count == 0);
	}
	int size() {
		return count;
	}
	bool isEmpty() {
		return count == 0;
	}
	void insert(Key key, Value value) {
		Node *node = head;
		while (node != NULL) {
			if (key == node->key) {
				node->value = value;
				return;
			}
			node = node->next;
		}
		Node *newNode = new Node(key, value);
		newNode->next = head;
		head = newNode