二进制求和

最新推荐文章于 2024-11-04 17:55:03 发布

我先冲了xdm

最新推荐文章于 2024-11-04 17:55:03 发布

阅读量94

点赞数

文章标签：算法 stack 栈 java 数据结构

本文链接：https://blog.csdn.net/asfsaf21/article/details/114795415

版权

我提供一个很容易理解的算法

class Solution {
    public String addBinary(String a, String b) {
        String max = Max(a,b);
        int max_index = max.length()-1;
        String min = Min(a,b);
        int min_index = min.length()-1;
        Stack<String> stack = new Stack<>();
        String s = "0"; 
        if(a.length() == b.length()){
            max = a;
            min = b ;
        }
        while(max_index != -1){
            if(min_index <= -1){
                if(max.charAt(max_index) == '1' || s == "1"){
                    if(max.charAt(max_index) == '1' && s == "1"){
                        stack.push("0");
                        s = "1";
                    }else{
                        stack.push("1");
                        s = "0";
                    }
                }else{
                    stack.push("0");
                    s = "0";
                }
            }else{
                if(max.charAt(max_index) == '1' || min.charAt(min_index) == '1'){
                    if(max.charAt(max_index) == '1' && min.charAt(min_index) == '1'){
                        if(s == "1"){
                            stack.push("1");
                        }else{
                            
                            stack.push("0");
                        }
                        s = "1";
                    }else{
                        if(s == "1"){
                            
                            stack.push("0");
                            s = "1" ;
                        }else{
                            
                            stack.push("1");
                            s = "0" ;
                        }
                    }
                }else{
                    if(s == "1"){
                        stack.push("1");
                    }else{
                        stack.push("0");
                    }
                    s = "0" ;
                }
            }
            max_index-- ;
            min_index-- ;
        }
        if(s == "1")stack.push("1");
        StringBuilder sum = new StringBuilder();
        while(!stack.isEmpty()){
            sum.append(stack.pop());
        }
        return sum.toString();
    }
    public String Max(String a,String b){
        return a.length() == Math.max(a.length(),b.length()) ? a : b ;
    }
    public String Min(String a,String b){
        return a.length() == Math.min(b.length(),a.length()) ? a : b ;
    }
}