#define _CRT_SECURE_NO_WARNINGS
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#define N 1000 //此处可以改输入大数据的位数
struct Add_Number
{
int num;
struct Add_Number *pnext;
};
typedef struct Add_Number A_N;
A_N* node(A_N*head, int inum) //创建链表
{
A_N *newnode = (A_N*)malloc(sizeof(A_N));
newnode->num = inum;
newnode->pnext = NULL;
if (head == NULL)
{
head = newnode;
}
else
{
A_N *p = head;
while (p->pnext != NULL)
{
p = p->pnext;
}
p->pnext = newnode;
}
return head;
}
A_N* Invert(A_N*head) //倒置链表
{
A_N *p1;
A_N *p2;
A_N *p3;
p1 = head;
p2 = head->pnext;
if (head == NULL || head->pnext == NULL)
{
return head;
}
while (p2 != NULL)
{
p3 = p2->pnext;
p2->pnext = p1;
p1 = p2;
p2 = p3;
}
head->pnext = NULL;
head = p1;
return head;
}
int Change_To_Str(A_N*head, char *number) //将链表中的数转换为字符数组中,返回数的个数
{
A_N *p = head;
int count = 0;
while (p != NULL)
{
number[count] = p->num + 48;
count++;
p = p->pnext;
}
return count;
}
void Show_All(A_N*head) //显示全部节点
{
A_N *p = head;
int zero = 0;
if (p->pnext == NULL)//只有一位并且相等时输出0
{
zero = 1;
}
while (p != NULL)
{
if ((p->num == 0) && (zero == 0)) //清楚前面无用的0
{
}
else
{
printf("%d", p->num);
zero = 1;
}
p = p->pnext;
if ((p!=NULL)&&(p->pnext == NULL) && (zero == 0))//此处p!=NULL 必须在前面,当P=NULL 时防止执行p->pnext
{
zero = 1;
}
}
printf("\n");
}
A_N* Free_all(A_N *head) //释放内存
{
A_N *p1, *p2;
p1 = head;
p2 = head->pnext;
while (p2 != NULL)
{
p1->pnext = p1->pnext->pnext;
free(p2);
p2 = p1->pnext;
}
free(p1);
head = NULL;
return head;
}
A_N * Sub(A_N*head1, A_N *head2, A_N *head3)
{
A_N*p1 = head1;
A_N*p2 = head2;
int sub_number;
int one;
int ten = 0;
while ((p1 != NULL) && (p2 != NULL))//实现减法
{
if (ten == 0)
{
sub_number = (p1->num) - (p2->num);
if (sub_number<0)
{
one = 10 + sub_number;
ten = 1;
head3 = node(head3, one);
}
else
{
head3 = node(head3, sub_number);
}
}
else
if (ten == 1)
{
sub_number = (p1->num) - (p2->num) - 1;
if (sub_number<0)
{
one = 10 + sub_number;
ten = 1;
head3 = node(head3, one);
}
else
{
head3 = node(head3, sub_number);
ten = 0;
}
}
p1 = p1->pnext;
p2 = p2->pnext;
}
while (p1 != NULL)
{
if (ten == 0)
{
sub_number = p1->num;
head3 = node(head3, sub_number);
}
else
{
sub_number = (p1->num) - 1;
if (sub_number<0)
{
one = 10 + sub_number;
ten = 1;
head3 = node(head3, one);
}
else
{
head3 = node(head3, sub_number);
ten = 0;
}
}
p1 = p1->pnext;
}
return head3;
}
int Input(char number1[], char number2[], int n)//输入数据,并且判断第一个数和第二个数的大小,如果第一个大返回0,第一个小返回1
{
int minus;//判断符号
scanf("%s%s", number1, number2);
int length_n1 = strlen(number1);
int length_n2 = strlen(number2);
if (length_n1 > n || length_n2 > n)
{
printf("ERROR:输入的数据超出范围!");
system("pause");
exit(1);
}
if (length_n1 > length_n2)
{
minus = 0;
}
else if (length_n1 < length_n2)
{
minus = 1;
}
else
{
for (int i =0 ; i <length_n1; i++)
{
if (number1[i] > number2[i])
{
minus = 0;
break;
}
else if (number1[i] < number2[i])
{
minus = 1;
break;
}
else
{
minus = 0;
}
}
}
return minus;
}
A_N *Change_node(char number[])//将字符数组转变成链表
{
A_N *head = NULL;
int length_n = strlen(number);
while (length_n > 0)
{
int num = (int)number[length_n - 1] - 48;
length_n--;
head = node(head, num);
}
return head;
}
void show()
{
A_N*head1 = NULL;
A_N*head2 = NULL;
A_N*head3 = NULL;
char number1[N] = { 0 };
char number2[N] = { 0 };
int minus;
minus = Input(number1, number2, N);
head1 = Change_node(number1);
head2 = Change_node(number2);
if (minus == 1)
{
head3 = Sub(head2, head1, head3);
head3 = Invert(head3);
printf("-");
Show_All(head3);
}
else if (minus == 0)
{
head3 = Sub(head1, head2, head3);
head3 = Invert(head3);
Show_All(head3);
}
head1=Free_all(head1);
head2=Free_all(head2);
head3=Free_all(head3);
system("pause");
}
void main()
{
show();//仅支持正数,不支持负数
}
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#define N 1000 //此处可以改输入大数据的位数
struct Add_Number
{
int num;
struct Add_Number *pnext;
};
typedef struct Add_Number A_N;
A_N* node(A_N*head, int inum) //创建链表
{
A_N *newnode = (A_N*)malloc(sizeof(A_N));
newnode->num = inum;
newnode->pnext = NULL;
if (head == NULL)
{
head = newnode;
}
else
{
A_N *p = head;
while (p->pnext != NULL)
{
p = p->pnext;
}
p->pnext = newnode;
}
return head;
}
A_N* Invert(A_N*head) //倒置链表
{
A_N *p1;
A_N *p2;
A_N *p3;
p1 = head;
p2 = head->pnext;
if (head == NULL || head->pnext == NULL)
{
return head;
}
while (p2 != NULL)
{
p3 = p2->pnext;
p2->pnext = p1;
p1 = p2;
p2 = p3;
}
head->pnext = NULL;
head = p1;
return head;
}
int Change_To_Str(A_N*head, char *number) //将链表中的数转换为字符数组中,返回数的个数
{
A_N *p = head;
int count = 0;
while (p != NULL)
{
number[count] = p->num + 48;
count++;
p = p->pnext;
}
return count;
}
void Show_All(A_N*head) //显示全部节点
{
A_N *p = head;
int zero = 0;
if (p->pnext == NULL)//只有一位并且相等时输出0
{
zero = 1;
}
while (p != NULL)
{
if ((p->num == 0) && (zero == 0)) //清楚前面无用的0
{
}
else
{
printf("%d", p->num);
zero = 1;
}
p = p->pnext;
if ((p!=NULL)&&(p->pnext == NULL) && (zero == 0))//此处p!=NULL 必须在前面,当P=NULL 时防止执行p->pnext
{
zero = 1;
}
}
printf("\n");
}
A_N* Free_all(A_N *head) //释放内存
{
A_N *p1, *p2;
p1 = head;
p2 = head->pnext;
while (p2 != NULL)
{
p1->pnext = p1->pnext->pnext;
free(p2);
p2 = p1->pnext;
}
free(p1);
head = NULL;
return head;
}
A_N * Sub(A_N*head1, A_N *head2, A_N *head3)
{
A_N*p1 = head1;
A_N*p2 = head2;
int sub_number;
int one;
int ten = 0;
while ((p1 != NULL) && (p2 != NULL))//实现减法
{
if (ten == 0)
{
sub_number = (p1->num) - (p2->num);
if (sub_number<0)
{
one = 10 + sub_number;
ten = 1;
head3 = node(head3, one);
}
else
{
head3 = node(head3, sub_number);
}
}
else
if (ten == 1)
{
sub_number = (p1->num) - (p2->num) - 1;
if (sub_number<0)
{
one = 10 + sub_number;
ten = 1;
head3 = node(head3, one);
}
else
{
head3 = node(head3, sub_number);
ten = 0;
}
}
p1 = p1->pnext;
p2 = p2->pnext;
}
while (p1 != NULL)
{
if (ten == 0)
{
sub_number = p1->num;
head3 = node(head3, sub_number);
}
else
{
sub_number = (p1->num) - 1;
if (sub_number<0)
{
one = 10 + sub_number;
ten = 1;
head3 = node(head3, one);
}
else
{
head3 = node(head3, sub_number);
ten = 0;
}
}
p1 = p1->pnext;
}
return head3;
}
int Input(char number1[], char number2[], int n)//输入数据,并且判断第一个数和第二个数的大小,如果第一个大返回0,第一个小返回1
{
int minus;//判断符号
scanf("%s%s", number1, number2);
int length_n1 = strlen(number1);
int length_n2 = strlen(number2);
if (length_n1 > n || length_n2 > n)
{
printf("ERROR:输入的数据超出范围!");
system("pause");
exit(1);
}
if (length_n1 > length_n2)
{
minus = 0;
}
else if (length_n1 < length_n2)
{
minus = 1;
}
else
{
for (int i =0 ; i <length_n1; i++)
{
if (number1[i] > number2[i])
{
minus = 0;
break;
}
else if (number1[i] < number2[i])
{
minus = 1;
break;
}
else
{
minus = 0;
}
}
}
return minus;
}
A_N *Change_node(char number[])//将字符数组转变成链表
{
A_N *head = NULL;
int length_n = strlen(number);
while (length_n > 0)
{
int num = (int)number[length_n - 1] - 48;
length_n--;
head = node(head, num);
}
return head;
}
void show()
{
A_N*head1 = NULL;
A_N*head2 = NULL;
A_N*head3 = NULL;
char number1[N] = { 0 };
char number2[N] = { 0 };
int minus;
minus = Input(number1, number2, N);
head1 = Change_node(number1);
head2 = Change_node(number2);
if (minus == 1)
{
head3 = Sub(head2, head1, head3);
head3 = Invert(head3);
printf("-");
Show_All(head3);
}
else if (minus == 0)
{
head3 = Sub(head1, head2, head3);
head3 = Invert(head3);
Show_All(head3);
}
head1=Free_all(head1);
head2=Free_all(head2);
head3=Free_all(head3);
system("pause");
}
void main()
{
show();//仅支持正数,不支持负数
}