【Leetcode】Compare Version Numbers

题目链接：https://leetcode.com/problems/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 int compareVersion(String version1, String version2) {
		String[] v1 = version1.split("\\.");
		String[] v2 = version2.split("\\.");
		int length = Math.max(v1.length, v2.length);
		int vv2[] = new int[length];
		int vv1[] = new int[length];
		for (int i = 0; i < v1.length; i++) {
			vv1[i] = Integer.parseInt(v1[i]);
		}
		for (int i = 0; i < v2.length; i++) {
			vv2[i] = Integer.parseInt(v2[i]);
		}
		
		int flag = -1;
		int i = 0, j = 0;
		while (i < length) {
			if (vv1[i] > vv2[i]) {
				flag = 1;
				break;
			} else if (vv1[i] < vv2[j]) {
				flag = -1;
				break;
			} else {
				flag = 0;
				i++;
				j++;
			}
		}
		return flag;
	}