leetcode Compare Version Numbers

Compare two version numbers version1 and version1.
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

Credits:
Special thanks to @ts for adding this problem and creating all test cases.

题目还是简单的，但是要考虑很多情况。

我写的代码边写边调试，写的比较烂。

public class Solution {
    public int compareVersion(String version1, String version2) {
        String[] versionsOne=version1.split("\.");
        String[] versionsTwo=version2.split("\.");
        int oneLength=versionsOne.length;
        int twoLength=versionsTwo.length;
        int length=oneLength<twoLength?oneLength:twoLength;
        
        for (int i = 0; i < length; i++) {
            while (versionsOne[i].startsWith("0")&&versionsOne[i].length()>1) {
                versionsOne[i]=versionsOne[i].substring(1);
            }
            while (versionsTwo[i].startsWith("0")&&versionsTwo[i].length()>1) {
                versionsTwo[i]=versionsTwo[i].substring(1);
            }
            if (versionsOne[i].length()>versionsTwo[i].length()) {
                return 1;
            }else if (versionsOne[i].length()<versionsTwo[i].length()) {
                return -1;
            }
            int l = versionsOne[i].length()<versionsTwo[i].length()?versionsOne[i].length():versionsTwo[i].length();
            for (int j = 0; j < l; j++) {
                int a=versionsOne[i].charAt(j);
                int b=versionsTwo[i].charAt(j);
                if (a>b) {
                    return 1;
                }else if (a<b) {
                    return -1;
                }
            }
            
        }
        if (oneLength>twoLength) {
            for (int i = twoLength; i < oneLength; i++) {
                for (int j = 0; j < versionsOne[i].length(); j++) {
                    if (versionsOne[i].charAt(j)>'0') {
                        return 1;
                    }
                }
            }
        }else if (oneLength<twoLength) {
            for (int i = oneLength; i < twoLength; i++) {
                for (int j = 0; j < versionsTwo[i].length(); j++) {
                    if (versionsTwo[i].charAt(j)>'0') {
                        return -1;
                    }
                }
            }
        }
        return 0;
    }
}