[Leetcode] Compare Version Numbers

Compare two version numbers version1 and version2.
If version1 > version2 return 1, if version1 < version2 return -1, otherwise return 0.

You may assume that the version strings are non-empty and contain only digits and the . character.
The . character does not represent a decimal point and is used to separate number sequences.
For instance, 2.5 is not "two and a half" or "half way to version three", it is the fifth second-level revision of the second first-level revision.

Here is an example of version numbers ordering:

0.1 < 1.1 < 1.2 < 13.37

public class Solution {
    public int compareVersion(String version1, String version2) {
        return compareVersionHelper(version1.toCharArray(), version2.toCharArray());
    }
    
    private int compareVersionHelper(char[] version1, char[] version2){
        if(version1 == null && version2 == null)
            return 0;
        else if(version1.length == 0 && version2.length == 0)
            return 0;
        else if(version1 == null){
            for(int i = 0; i < version2.length; i++){
                if(version2[i] == '.') continue;
                else if(version2[i] != '0') return -1;
            }
            return 0;
        }
        else if(version2 == null){
            for(int i = 0; i < version1.length; i++){
                if(version1[i] == '.') continue;
                else if(version1[i] != '0') return 1;
            }
            return 0;
        }
        
        int version1Index = 0;
        int version1Value = 0;
        while(version1Index < version1.length && version1[version1Index] != '.'){
            version1Value *= 10;
            version1Value += version1[version1Index] - '0';
            version1Index++;
        }
        if(version1Index < version1.length && version1[version1Index] == '.') version1Index++;
        
        int version2Index = 0;
        int version2Value = 0;
        while(version2Index < version2.length && version2[version2Index] != '.'){
            version2Value *= 10;
            version2Value += version2[version2Index] - '0';
            version2Index++;
        }
        if(version2Index < version2.length && version2[version2Index] == '.') version2Index++;
        
        if(version1Value > version2Value)
            return 1;
        else if(version1Value < version2Value)
            return -1;
        else{
            return compareVersionHelper(Arrays.copyOfRange(version1, version1Index, version1.length), Arrays.copyOfRange(version2, version2Index, version2.length));
        }
    }
}