📄 search.cpp
字号:
#include <malloc.h>
#include <stdio.h>
#include "node.h"
Node *create_link();
int arr[]={20,13,57,2,40,108,78};
#define N_SIZE sizeof(arr)/sizeof(arr[0])
int compare(void const *v1,void const *v2);
Node *search(Node *node,void const *value,int (*compare)(void const *v1,void const *v2));
void main(void)
{
Node *node;
node=create_link();
node=search(node,&arr[4],compare);
if (node!=NULL)
printf("%d",node->value);
}
Node *create_link()
{
int i;
Node *head,*temp,*prev;
head=(struct NODE *)malloc(sizeof(Node));
prev=head;
for (i=0;i<N_SIZE;i++) {
temp=(struct NODE *)malloc(sizeof(Node));
temp->link=NULL;
temp->value=arr[i];
prev->link=temp;
prev=temp;
}
return head;
}
Node *search(Node *node,void const *value,int (*compare)(void const *v1,void const *v2))
{
while (node!=NULL) {
if (compare(&node->value,value)==0)
break;
node=node->link;
}
return node;
}
int compare(void const *v1,void const *v2)
{
if (*(int *)v1==*(int *)v2)
return 0;
else
return 1;
}
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -