import java.util.*;
public class Test {
public static void fun2(String s1,String s2){
Deque<Integer> stack1=new LinkedList<>();
Deque<Integer> stack2=new LinkedList<>();
Deque <Integer> stack3=new LinkedList<>();
for (int i = 0; i < s1.length(); i++) {
int ch=s1.charAt(i)-'0';
stack2.push(ch);
}
for (int i = 0; i < s2.length(); i++) {
int ch=s2.charAt(i)-'0';
stack3.push(ch);
}
while(!stack2.isEmpty()&&!stack3.isEmpty()){
if(stack2.peek()<stack3.peek()){
stack1.push(stack2.pop()+10-stack3.pop());
}
}
}
public static void fun1(String s1,String s2){
Deque<Integer> stack1=new LinkedList<>();
Deque<Integer> stack2=new LinkedList<>();
Deque <Integer> stack3=new LinkedList<>();
for (int i = 0; i < s1.length(); i++) {
int ch=s1.charAt(i)-'0';
stack2.push(ch);
}
for (int i = 0; i < s2.length(); i++) {
int ch=s2.charAt(i)-'0';
stack3.push(ch);
}
int k=0;
while(!stack2.isEmpty()&&!stack3.isEmpty()){
int tmp=stack2.poll()+stack3.poll()+k;
if(tmp>=10){
k=1;
int ca=tmp%10;
stack1.push(ca);
}
else{
k=0;
int ca=tmp%10;
stack1.push(ca);
}
}
if(!stack2.isEmpty()&&stack3.isEmpty()){
while(!stack2.isEmpty()) {
int tmp = stack2.poll() + k;
if(tmp>=10){
k=1;
int ch=tmp%10;
stack1.push(ch);
}else {
k = 0;
int ca = tmp % 10;
stack1.push(ca);
}
}
if(k==1){ //前几个高位是99...
stack1.push(1);
k=0;
}
}else if(stack2.isEmpty()&&!stack3.isEmpty()){
while(!stack3.isEmpty()) {
int tmp = stack3.poll() + k;
if(tmp>=10){
k=1;
int ch=tmp%10;
stack1.push(ch);
}else {
k = 0;
int ca = tmp % 10;
stack1.push(ca);
}
}
if(k==1){ //前几个高位是99...
stack1.push(1);
}
}else{
if(k==1){
stack1.push(1);
}
}
while(!stack1.isEmpty()){
System.out.print(stack1.pop());
}
}
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
String s1=sc.nextLine();
String s2=sc.nextLine();
if(s1.charAt(0)!='-'&&s2.charAt(0)!='-'){
fun1(s1,s2);
}else if(s1.charAt(0)=='-'&&s2.charAt(0)=='-'){
String newS1=s1.replaceAll("-","");
String newS2=s2.replaceAll("-","");
System.out.print("-");
fun1(newS1,newS2);
}else{
if(s1.charAt(0)=='-'&&s2.charAt(0)!='-'){
String newS1=s1.replaceAll("-","");
if(newS1.compareTo(s2)>0){
}
}
}
}
public static void main1(String[] args) {
Scanner sc=new Scanner(System.in);
String s1=sc.nextLine();
String s2=sc.nextLine();
Deque<Integer> stack1=new LinkedList<>();
Deque<Integer> stack2=new LinkedList<>();
Deque <Integer> stack3=new LinkedList<>();
for (int i = 0; i < s1.length(); i++) {
int ch=s1.charAt(i)-'0';
stack2.push(ch);
}
for (int i = 0; i < s2.length(); i++) {
int ch=s2.charAt(i)-'0';
stack3.push(ch);
}
int k=0;
while(!stack2.isEmpty()&&!stack3.isEmpty()){
int tmp=stack2.poll()+stack3.poll()+k;
if(tmp>=10){
k=1;
int ca=tmp%10;
stack1.push(ca);
}
else{
k=0;
int ca=tmp%10;
stack1.push(ca);
}
}
if(!stack2.isEmpty()&&stack3.isEmpty()){
while(!stack2.isEmpty()) {
int tmp = stack2.poll() + k;
if(tmp>=10){
k=1;
int ch=tmp%10;
stack1.push(ch);
}else {
k = 0;
int ca = tmp % 10;
stack1.push(ca);
}
}
if(k==1){ //前几个高位是99...
stack1.push(1);
k=0;
}
}else if(stack2.isEmpty()&&!stack3.isEmpty()){
while(!stack3.isEmpty()) {
int tmp = stack3.poll() + k;
if(tmp>=10){
k=1;
int ch=tmp%10;
stack1.push(ch);
}else {
k = 0;
int ca = tmp % 10;
stack1.push(ca);
}
}
if(k==1){ //前几个高位是99...
stack1.push(1);
}
}else{
if(k==1){
stack1.push(1);
}
}
while(!stack1.isEmpty()){
System.out.print(stack1.poll());
}
}
}
C语言题目仓库-算法.zip
需积分: 5 117 浏览量
2023-11-13
10:16:27
上传
评论
收藏 4.65MB ZIP 举报
C语言题目仓库-算法.zip （169个子文件） 
test.c 3KB test.c 2KB test.c 2KB test.c 1KB Test.class 4KB Test3.class 3KB Test.class 3KB Test3.class 2KB Test.class 2KB Test.class 2KB Test2.class 2KB Test.class 2KB Test2.class 2KB Test.class 1KB Test4.class 1KB Main.class 516B Main.class 516B Main.class 516B Main.class 516B Main.class 516B Main.class 516B Test3$1.class 423B MyValue.class 261B Browse.VC.db 1.7MB Browse.VC.db 1.52MB Browse.VC.db 1.41MB Browse.VC.db 1.4MB
判断双对称矩阵.exe 64KB 逐行排序.exe 64KB 蛇形矩阵.exe 63KB 杨氏矩阵.exe 63KB 判断双对称矩阵.vcxproj.filters 943B 蛇形矩阵.vcxproj.filters 943B 逐行排序.vcxproj.filters 943B 杨氏矩阵.vcxproj.filters 943B .gitignore 47B .gitignore 47B .gitignore 47B .gitignore 47B .gitignore 47B .gitignore 47B .gitignore 47B vc143.idb 35KB vc143.idb 27KB vc143.idb 27KB vc143.idb 27KB 蛇形矩阵.ilk 594KB 逐行排序.ilk 592KB 判断双对称矩阵.ilk 579KB 杨氏矩阵.ilk 578KB J-20231022.iml 423B J-20231110.iml 423B J-20231030.iml 423B J-20231017.iml 423B J-20231020.iml 423B J-20231112.iml 423B J-20231106.iml 423B TEST.ipch 3.13MB TEST.ipch 2.63MB TEST.ipch 2.13MB TEST.ipch 2.13MB Test.java 5KB Test.java 3KB Test.java 3KB Test.java 2KB Test.java 2KB Test3.java 1KB Test.java 1KB Test3.java 1KB Test2.java 1KB Test2.java 939B Test.java 707B Test4.java 651B Main.java 116B Main.java 116B Main.java 116B Main.java 116B Main.java 116B Main.java 116B Main.java 116B 判断双对称矩阵.lastbuildstate 191B 蛇形矩阵.lastbuildstate 182B 逐行排序.lastbuildstate 182B 杨氏矩阵.lastbuildstate 182B read.lock 0B read.lock 0B 逐行排序.log 440B 判断双对称矩阵.log 147B 蛇形矩阵.log 120B 杨氏矩阵.log 120B test.obj 20KB test.obj 18KB test.obj 16KB test.obj 15KB 逐行排序.pdb 1.03MB 蛇形矩阵.pdb 1.01MB 判断双对称矩阵.pdb 916KB 杨氏矩阵.pdb 916KB vc143.pdb 76KB vc143.pdb 76KB共 169 条
- 1
- 2
资源评论
