順序表按值查找問題，不論輸入正確或錯誤，輸出的結果都是沒有找到。
#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<stdio.h>
#include <malloc.h>
#include <stdlib.h>
using namespace std;
#define MAXSIZE 10
#define OK 1
#define ERROR 0
#define OVERFLOW -2
typedef struct {
const char* name;
const char* number;
int grade;
}ElemType;
typedef struct {
ElemType* elem;
int length;
int listsize;
}SqList;
//構造一個空的順序表
int InitList_Sq(SqList& L)
{
L.elem = new ElemType[MAXSIZE];
if (!L.elem) exit(OVERFLOW);
L.length = 0;
L.listsize = MAXSIZE;
return OK;
}
int append_Sq(SqList* L, ElemType e)
{
int i = L->length;
L->elem[i] = e;
L->length++;
return OK;
}
//獲取線性表L中第i個資料元素的內容
int GetElem(SqList L, int i, ElemType& e)
{
if (i<1 || i>L.length) return ERROR;
e = L.elem[i - 1];
return OK;
}
//找線性表中與e相等的資料元素，回傳它在線性表中的位置。
int LocateElem(SqList L, ElemType e)
{
int i;
for (i = 0; i < L.length; i++)
{
if ((L.elem[i].name == e.name) && (L.elem[i].number == e.number) && (L.elem[i].grade == e.grade))
return i + 1;
}
return 0;
}
//判定線性表是否為“滿”
int isFull_Sq(SqList* L)
{
return L->length == MAXSIZE ? OK : ERROR;
}
//判定線性表是否為“空”
int isEmpty_Sq(SqList* L)
{
return L->length == 0 ? OK : ERROR;
}
//在線性表的第i行插入資料元素e
int ListInsert_Sq(SqList& L, int i, ElemType e)
{
if (i<1 || i>L.length + 1)
return ERROR;
if (L.length == MAXSIZE)
return ERROR;
for (int j = L.length - 1; j >= i - 1; j--)
{
L.elem[j + 1] = L.elem[j];
L.elem[i - 1] = e;
++L.length;
}
return OK;
}
//洗掉線性表
int ListDelete_Sq(SqList& L, int i)
{
if ((i < 1) || (i > L.length))
return ERROR;
for (int j = i; j <= L.length - 1; j++)
L.elem[j - 1] = L.elem[j];
--L.length;
return OK;
}
//此程式用于輸出判斷線性表在某一區域內的內容
void ListTraverse(SqList L)
{
int i;
printf("線性表當前容量為：%d\n", L.listsize);
if (L.length > 0)
{
printf("當前線性表有%d個元素,分別是\n", L.length);
for (i = 0; i <= L.length; i++)
{
printf("%s %s %d \n", L.elem[i].name, L.elem[i].number, L.elem[i].grade);
}
}
else
printf("目前還是空線性表.\n");
}
int main()
{
//第一步 初始化線性表
SqList L;
int i;
printf("第一步 創建結構體變數，進行初始化\n");
InitList_Sq(L);
printf("第二步 給順序表賦值\n");
//第二步 給順序表賦值
ElemType s[4] = {
{"yangyang","060214201",79},
{"xuelin","060214202",83},
{"wangshimeng","060214203",92},
{"fengzihan","060214204",88}
};
for (i = 1; i <= 4; i++)
{
if (append_Sq(&L, s[i - 1]))
printf("添加資料成功\n");
else
printf("添加資料失敗\n");
}
//第三步 判斷線性表是否為滿
printf("第三步 判斷線性表是否為滿\n");
int isFull_Sq(SqList L);
if (OK)
printf("線性表不為滿\n");
else
printf("線性表為滿\n");
//第四步 判斷線性表是否為空
printf("第四步 判斷線性表是否為空\n");
int isEmpty_Sq(SqList L);
if (OK)
printf("線性表不為空\n");
else
printf("線性表為空\n");
//第五步 按照位置k取值
printf("第五步 按照位置k取值");
int k, getElem_flag;
ElemType value;
printf("請輸入位置k的值: ");
scanf("%d", &k);
getElem_flag = GetElem(L, k, value);
if (getElem_flag == 1)
{
printf("獲取到的資料為：\n");
printf("%s %s %d\n", value.name, value.number, value.grade);
}
else
printf("輸入的位置越界!\n");
//第六步 按值e查找,回傳位置
printf("第六步 按值e查找,回傳位置\n");
int local_flag;
ElemType e;
printf("請輸入查詢值：\n");
scanf("%s %s %d", &e.name, &e.number, &e.grade);
local_flag = LocateElem(L, e);
if (local_flag != 0)
printf("該元素的位置是：%d \n", local_flag);
else
printf("沒有找到該元素!\n");
//第七步 插入運算
printf("第七步 在位置i處插入元素e\n");
int Insert_i, Insert_flag;
int h = 0;
ElemType Insert_value;
printf("請輸入位置i:");
scanf("%d", &Insert_i);
printf("請輸入插入的值:");
scanf("%s %s %d", &Insert_value.name, &Insert_value.number, &Insert_value.grade);
Insert_flag = ListInsert_Sq(L, Insert_i, Insert_value);
if (Insert_flag)
{
printf("插入成功!\n");
printf("當前順序表L的長度是%d\n", L.length);
}
else
printf("插入失敗!\n");
//第八步 洗掉運算,將表中的第i個元素洗掉
printf("第八步 洗掉運算,將表中的第i個元素洗掉\n");
int delete_i, delete_flag;
printf("請輸入要洗掉的元素i");
scanf("%d", &delete_i);
delete_flag = ListDelete_Sq(L, delete_i);
if (delete_flag)
{
printf("洗掉成功!");
printf("當前順序表L的長度是%d\n", L.length);
}
return OK;
}
轉載請註明出處，本文鏈接：https://www.uj5u.com/houduan/189756.html
標籤：新手樂園
上一篇：運算式必須含有常量值
下一篇：我的代碼錯在哪里？