题解 | 浮点数加法

#include <iostream>
#include <string>
#include <vector>
using namespace std;

int main() {
    string num1,num2;
    cin>>num1>>num2;
    int p1=num1.find('.');
    int p2=num2.find('.');
    int gap=p1-p2;
  //前后空格一致
    while(gap>0) num2='0'+num2,gap--;
    while(gap<0) num1='0'+num1,gap++;
    gap=num1.length()-num2.length();
    while(gap>0) num2=num2+'0',gap--;
    while(gap<0) num1=num1+'0',gap++;
    string res;
  //处理进位
    int forward=0;
    for(int i=num1.length()-1;i>=0;i--)
    {
        if(num1[i]=='.') res='.'+res;
        else{
            int number=(num1[i]-'0')+(num2[i]-'0')+forward;
            forward=number/10;
            char tmp=number%10+'0';
            res=tmp+res;
        }
    }
    if(forward) {
        char tmp=forward+'0';
        res=tmp+res;
    }
    cout<<res<<endl;
}
// 64 位输出请用 printf("%lld")