plusminus.h

数据结构课程设计 长整数相加减 long Interge plus minus

#define limitedNum 10000
void plusCalculate(LHList<int> &firstNum,LHList<int> &secondNum,char reusltflage)
{
 LHList<int> result;
 int first,second;
 int templResult;
 int firstCount=firstNum.getCount();
 int secondCount=secondNum.getCount();
 int maxCount=firstCount;
 int carry=0;
 if(firstCount<secondCount)
	 maxCount=secondCount;
  for(int i=1;i<=maxCount;i++)
  {
   first=firstNum.getLastNodeValue();
   second=secondNum.getLastNodeValue();
   templResult=first+second+carry;
   if(templResult>=limitedNum)
   {
    carry=templResult/limitedNum;
    templResult=templResult%limitedNum;
   }
   result.appendNode(templResult);
  }
  if(carry>0)
  result.appendNode(carry);  

  cout<<"结果是：";
  if(reusltflage!='+')
	   cout<<reusltflage;
  result.printListAthwartorder();
  cout<<endl;
}

void minusCalculate(LHList<int> firstNum,LHList<int> secondNum,char reusltflage)
{
 LHList<int> result;
 int first,second;
 int templResult;
 int firstCount=firstNum.getCount();
 int secondCount=secondNum.getCount();
 int maxCount=firstCount;
 int borrow=0;
 if(firstCount<secondCount)
	 maxCount=secondCount;
  for(int i=1;i<=maxCount;i++)
  {
   first=firstNum.getLastNodeValue();
   second=secondNum.getLastNodeValue();
   first=first+borrow;
   if(first<second)
   {
    borrow=-1;
	first=10000+first;
   }
   templResult=first-second;   
   result.appendNode(templResult);
  }

  cout<<"结果是：";
  if(reusltflage!='+')
	   cout<<reusltflage;
  result.printListAthwartorder();
  cout<<endl;
}