标签:character represent otherwise version separate
Compare two version numbers version1 and version2. You may assume that the version strings are non-empty and contain only digits and the Here is an example of version numbers ordering: 0.1 < 1.1 < 1.2 < 13.37 Credits: 165 主要问题 1. 字符串中是否包含.字符 2. 字符串中包含多个.字符 3. 包含.字符的字符串后缀都是0的情况,例如1.0.0与1的比较 java字符串在处理.字符时,一定要注意添加"\\"->"\\." public class Solution { public int compareVersion(String version1, String version2) {
String w1[]=version1.split("\\."); String w2[]=version2.split("\\."); int l1=w1.length; int l2=w2.length; int l=l1; if(l2<l1) l=l2; int i=0; for(i=0;i<l;i++) { int a=Integer.parseInt(w1[i]); int b=Integer.parseInt(w2[i]); if(a<b) return -1; if(a>b) return 1; } if(l1<l2) { for(i=l;i<l2;i++) if(Integer.parseInt(w2[i])>0) return -1; return 0; } else if(l1>l2) { for(i=l;i<l1;i++) if(Integer.parseInt(w1[i])>0) return 1; return 0; } else return 0; } } | Compare Version Number |
Leetcode#165Compare Version Numbers
标签:character represent otherwise version separate
原文地址:http://7061299.blog.51cto.com/7051299/1640018