题目:A+B FORMAT
我的代码:
#include<iostream>
#include<string>
#include<cstring>
#include<algorithm>
using namespace std;
int main(){ //还有一种思路是用整数和栈来做
long long a,b;
string str,out;
int i = 0,j = 0;
cin>>a>>b;
str = to_string(a+b); //整数转字符串函数
for(i = str.length() - 1;i >= 0;i--,j++){
if(j == 3 && str[i] >= '0' && str[i] <= '9'){
out.append(",");
out += str[i]; //这里可以insert,相当于头插法,后面就不用了逆序了
j = 0; //更新j的值,4为一个周期
}
else out += str[i];
}
reverse(out.begin(),out.end());
cout<<out;
return 0;
}
参考代码:
链接:https://www.nowcoder.com/questionTerminal/30ebf35cea7f4e8398dd0f12c069dc76
来源:牛客网
#include <iostream>
#include <string>
#include <set>
#include <algorithm>
#include <iomanip>
#include <cstdio>
#include <vector>
#include <stdlib.h>
#include <stack>
#include <deque>
#include <cstring>
using namespace std;
#define Mod 1000000007
void slove(int x);
int main()
{
int a, b, ans;
cin>>a>>b;
ans=a+b;
slove(ans);
return 0;
}
void slove(int x){
if(x==0) {cout<<"0"<<endl;return ;}
if(x<0){cout<<"-"; x=-x;}
stack<int>s;
while(x){
int t=x%10;
s.push(t);
x/=10;
}
while(!s.empty()){
cout<<s.top();
s.pop();
int len=s.size();
if(len%3==0&&len) cout<<",";
}
cout<<endl;
}
收获:用整数和栈来做,len%3 && len那里用的很好
参考代码二:
链接:https://www.nowcoder.com/questionTerminal/30ebf35cea7f4e8398dd0f12c069dc76
来源:牛客网
#include<stdio.h>
int main()
{
int x, y;
while (~scanf("%d%d", &x, &y))
{
int sum = x + y;
if (sum < 0)
{
printf("-");
sum = -sum;
}
if (sum<1000 && sum>-1000)
printf("%d\n", sum);
else if (sum<1000000 && sum>-1000000)
printf("%d,%03d\n", sum / 1000, sum % 1000);
else
printf("%d,%03d,%03d\n", sum / 1000000, sum / 1000 - 1000 * (sum / 1000000), sum % 1000);
}
return 0;
}
收获:这种思路很特别,完全摸透了题目。