快崩潰了都，求大佬指點
完整代碼如下
#include<iostream>
using namespace std;
#include <time.h>
#include <stdio.h>
#include <dos.h>
#include <conio.h>
static int target[9] = { 7,1,3,4,8,6,5,0,2 };//目標狀態
//class definition
class eight_num
{
private:
int num[9];
int not_in_position_num;
int deapth;
int eva_function;
public:
eight_num* parent;
eight_num* leaf_next;
eight_num* leaf_pre;
eight_num(int init_num[9]);
eight_num(int num1, int num2, int num3, int num4, int num5, int num6, int num7, int num8, int num9)
{
num[0] = num1;
num[1] = num2;
num[2] = num3;
num[3] = num4;
num[4] = num5;
num[5] = num6;
num[6] = num7;
num[7] = num8;
num[8] = num9;
}
eight_num(void)
{
for (int i = 0; i < 9; i++)
num[i] = i;
}
void cul_para(void);
void get_numbers_to(int other_num[9]);
int get_nipn(void)
{
return not_in_position_num;
}
int get_deapth(void)
{
return deapth;
}
int get_evafun(void)
{
return eva_function;
}
void set_num(int other_num[9]);
void show(void);
eight_num& operator=(eight_num&);
eight_num& operator=(int other_num[9]);
int operator==(eight_num&);
int operator==(int other_num[9]);
};
//計算啟發函式g(n)的值
void eight_num::cul_para(void)
{
int i;
int temp_nipn = 0;
for (i = 0; i < 9; i++)
if (num[i] != target[i])
temp_nipn++;
not_in_position_num = temp_nipn;
if (this->parent == NULL)
deapth = 0;
else
deapth = this->parent->deapth + 1;
eva_function = not_in_position_num + deapth;
}
//建構式1
eight_num::eight_num(int init_num[9])
{
for (int i = 0; i < 9; i++)
num[i] = init_num[i];
}
//顯示當前節點的狀態
void eight_num::show()
{
cout << num[0];
cout << " ";
cout << num[1];
cout << " ";
cout << num[2];
cout << "\n";
cout << num[3];
cout << " ";
cout << num[4];
cout << " ";
cout << num[5];
cout << "\n";
cout << num[6];
cout << " ";
cout << num[7];
cout << " ";
cout << num[8];
cout << "\n";
}
//復制當前節點狀態到一個另陣列中
void eight_num::get_numbers_to(int other_num[9])
{
for (int i = 0; i < 9; i++)
other_num[i] = num[i];
}
//設定當前節點狀態(欲設定的狀態記錄的other陣列中)
void eight_num::set_num(int other_num[9])
{
for (int i = 0; i < 9; i++)
num[i] = other_num[i];
}
eight_num& eight_num::operator=(eight_num& another_8num)
{
for (int i = 0; i < 9; i++)
num[i] = another_8num.num[i];
not_in_position_num = another_8num.not_in_position_num;
deapth = another_8num.deapth + 1;
eva_function = not_in_position_num + deapth;
return *this;
}
eight_num& eight_num::operator=(int other_num[9])
{
for (int i = 0; i < 9; i++)
num[i] = other_num[i];
return *this;
}
int eight_num::operator==(eight_num& another_8num)
{
int match = 1;
for (int i = 0; i < 9; i++)
if (num[i] != another_8num.num[i])
{
match = 0;
break;
}
if (match == 0)
return 0;
else
return 1;
}
int eight_num::operator==(int other_num[9])
{
int match = 1;
for (int i = 0; i < 9; i++)
if (num[i] != other_num[i])
{
match = 0;
break;
}
if (match == 0)
return 0;
else
return 1;
}
//class definition over
//空格向上移
int move_up(int num[9])
{
for (int i = 0; i < 9; i++)
{
if (num[i] == 0)
break;
if (i < 3)
return 0;
else
{
num[i] = num[i - 3];
num[i - 3] = 0;
return 1;
}
}
}
//空格向下移
int move_down(int num[9])
{
for (int i = 0; i < 9; i++)
{
if (num[i] == 0)
break;
if (i > 5)
return 0;
else
{
num[i] = num[i + 3];
num[i + 3] = 0;
return 1;
}
}
}
//空格向左移
int move_left(int num[9])
{
for (int i = 0; i < 9; i++)
{
if (num[i] == 0)
break;
if (i == 0 || i == 3 || i == 6)
return 0;
else
{
num[i] = num[i - 1];
num[i - 1] = 0;
return 1;
}
}
}
//空格向右移
int move_right(int num[9])
{
for (int i = 0; i < 9; i++)
{
if (num[i] == 0)
break;
if (i == 2 || i == 5 || i == 8)
return 0;
else
{
num[i] = num[i + 1];
num[i + 1] = 0;
return 1;
}
}
}
//判斷可否解出
int icansolve(int num[9], int target[9])
{
int i, j;
int count_num=0;//?????????????????????????????????????????????????????????????????
int count_target=0;
for (i = 0; i < 9; i++)
{
for (j = 0; j < i; j++)
{
if (num[j] < num[i] && num[j] != 0)
count_num++;
if (target[j] < target[i] && target[j] != 0)
count_target = count_target + 1;
}
if ((count_num + count_target) % 2 == 0)
return 1;
else
return 0;
}
}
//判斷有無重復
int existed(int num[9], eight_num* where)
{
eight_num* p;
for (p = where; p != NULL; p = p->parent)
if (*p == num)
return 1;
return 0;
}
//尋找估價函式最小的葉子節點
eight_num* find_OK_leaf(eight_num* start)
{
eight_num* p, * OK;
p = OK = start;
int min = start->get_evafun();
for (p = start; p != NULL; p = p->leaf_next)
if (min > p->get_evafun())
{
OK = p;
min = p->get_evafun();
}
return OK;
}
//主函式開始
int main(void)
{
double time;
clock_t Start, Finish;
int memery_used = 0, step = 0;
int num[9];
int flag = 0;//是否輸入錯誤標志，1表示輸入錯誤
int bingo = 0;//是否查找成功標志，1表示成功
int i, j;
cout << "請輸入數字（）:\n";
for (i = 0; i < 9; i++)
{
flag = 0;
cin >> num[i];
for (j = 0; j < i; j++)
if (num[i] == num[j])
flag = 1;
if (num[i] < 0 || num[i]>8 || flag == 1)
{
i--;
cout << "非法數字！！！！！！！！！！！\t重新輸入!\n";
}
}
eight_num S(num), Target(target);
S.parent = S.leaf_next = S.leaf_pre = NULL;
S.cul_para();
memery_used++;
cout << "初始狀態：\n";
S.show();
cout << "目標狀態:\n";
Target.show();
if (!icansolve(num, target))
{
cout << "！！！！無解！！！！！\n";
cin >> i;
return 1;
}
Start = clock();
eight_num* OK_leaf = &S, * leaf_start = &S, * new_8num, * p;
while (OK_leaf != NULL && bingo != 1)
{
OK_leaf = find_OK_leaf(leaf_start);
if (*OK_leaf == Target)
{
bingo = 1;
break;
}
p = OK_leaf->leaf_pre;
OK_leaf->get_numbers_to(num);
if (move_up(num) && !existed(num, OK_leaf))
{
new_8num = new eight_num;
new_8num->set_num(num);
new_8num->parent = OK_leaf;
new_8num->cul_para();
new_8num->leaf_pre = p;
if (p == NULL)
leaf_start = new_8num;
else
p->leaf_next = new_8num;
p = new_8num;
memery_used++;
}
OK_leaf->get_numbers_to(num);
if (move_down(num) && !existed(num, OK_leaf))
{
new_8num = new eight_num;
new_8num->set_num(num);
new_8num->parent = OK_leaf;
new_8num->cul_para();
new_8num->leaf_pre = p;
if (p == NULL)
leaf_start = new_8num;
else
p->leaf_next = new_8num;
p = new_8num;
memery_used++;
}
OK_leaf->get_numbers_to(num);
if (move_left(num) && !existed(num, OK_leaf))
{
new_8num = new eight_num;
new_8num->set_num(num);
new_8num->parent = OK_leaf;
new_8num->cul_para();
new_8num->leaf_pre = p;
if (p == NULL)
leaf_start = new_8num;
else
p->leaf_next = new_8num;
p = new_8num;
memery_used++;
}
OK_leaf->get_numbers_to(num);
if (move_right(num) && !existed(num, OK_leaf))
{
new_8num = new eight_num;
new_8num->set_num(num);
new_8num->parent = OK_leaf;
new_8num->cul_para();
new_8num->leaf_pre = p;
if (p == NULL)
leaf_start = new_8num;
else
p->leaf_next = new_8num;
p = new_8num;
memery_used++;
}
p->leaf_next = OK_leaf->leaf_next;
if (OK_leaf->leaf_next != NULL)
OK_leaf->leaf_next->leaf_pre = p;
OK_leaf->leaf_next = OK_leaf->leaf_pre = NULL;
}
Finish = clock();
if (bingo == 1)
{
time = (double)(Finish - Start) * 1000 / CLOCKS_PER_SEC;
eight_num* p;
for (p = OK_leaf->parent; p != NULL; p = p->parent)
{
cout << " ^\n";
p->show();
step++;
}
cout << "用時:";
cout << time;
cout << "ms\n";
cout << "總共用了:";
cout << step;
cout << "步\n";
}
else
cout << "搜索失敗!";
return 0;
}
uj5u.com熱心網友回復：
p是null，你除錯跟蹤一下p是不是沒有賦值uj5u.com熱心網友回復：
能寫這么長的代碼了，該學學除錯了。至少吧。列印除錯早該會了。它報錯說的是，你這個指標是null指標
轉載請註明出處，本文鏈接：https://www.uj5u.com/houduan/35911.html
標籤：C++ 語言
上一篇：Makefile找不到頭檔案