leetcode 116: Multiply Strings (uncompleted)

Multiply Strings Mar 12 '12

Given two numbers represented as strings, return multiplication of the numbers as a string.

Note: The numbers can be arbitrarily large and are non-negative.

uncompleted.

public class Solution {
    public String multiply(String num1, String num2) {
        // Start typing your Java solution below
        // DO NOT write main() function
        if(num1==null || num2==null || num1.length()==0 || num2.length()==0) return null;
        int sz1 = num1.length();
        int sz2 = num2.length();
        
        int[] res = new int[sz1+sz2];
        
        for(int i=sz1-1, shift=sz1+sz2-1; i>=0; i--, shift--) {
            
            int x = num1.charAt(i) - '0';
            int carry = 0;
            int start = shift;
            for(int j=sz2-1; j>=0; j--) {
                int y = num2.charAt(j) - '0';
                int z = x*y + res[start];
                res[start--] =  z%10;
                carry = z/10;
            }
            if(carry>0) res[start] += carry; //maybe greater than 10
        }
        
        StringBuilder sb = new StringBuilder();
        
        for(int i=0; i<res.length; i++) {          
            if(res[i]!=0) sb.append( res[i] );
        }
        
        return sb.length()==0 ? "0" : sb.toString();
    }
}