leetcode_165

public class  {
    public int compareVersion(String version1, String version2) {
        Queue<Integer> q1 = getQueue(version1);
        Queue<Integer> q2 = getQueue(version2);
        
        while(!q1.isEmpty() && !q2.isEmpty()) {
            Integer num1 = q1.poll();
            Integer num2 = q2.poll();
            
            if(num1.compareTo(num2) != 0) {
                return num1.compareTo(num2);
            }
        }
        
        
        while(!q1.isEmpty()){
            if(q1.poll() !=0 ){
                return  1;
            }
        }
        
        while(!q2.isEmpty()){
            if(q2.poll() !=0 ){
                return  -1;
            }
        } 
        
        return 0;
        
    }
    
    private Queue<Integer> getQueue(String s) {
        Queue<Integer> q = new LinkedList<>();
        int num = 0;
        for(int i = 0; i < s.length(); i++) {
            if(s.charAt(i)=='.'){
                q.add(num);
                num = 0;
            } else {
                num = num * 10 + Character.getNumericValue(s.charAt(i));
            }
        }
        // 不要忘了最后这一次add
        q.add(num);
        
        return q;
    }
}