Compare Version Numbers

來源:互聯網
上載者:User

標籤:style   http   ar   io   color   os   sp   for   on   

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.



#include<stdio.h>#include<string.h>int compareVersion(char *version1, char *version2) {    int i , j , k , data1 = 0 , data2 = 0;    for(i = 0,j = 0; version1[i] != '\0' && version2[j] != '\0';){        if(version1[i] == '.' && version2[j] == '.'){            if(data1 > data2) return 1;            if(data1 < data2) return -1;            data1 = 0;            data2 = 0;            i++;            j++;        }        else if(version1[i] != '.' && version2[j] == '.') {            while(version1[i] != '.' && version1[i] != '\0'){                data1 = data1*10 + version1[i]-'0';                i++;            }            if(version1[i]=='\0') break;        }        else if(version1[i] == '.' && version2[j] != '.') {            while(version2[j] != '.' && version2[j] != '\0'){                data2 = data2*10 + version2[j]-'0';                j++;            }            if(version2[j]=='\0') break;        }        else{            data1 = data1*10 + version1[i]-'0';            data2 = data2*10 + version2[j]-'0';            i++;            j++;        }    }    if(version1[i] == '\0' && version2[j] != '\0') {        if(version2[j] == '.' ) {            k=j+1;            if(data1 > data2) return 1;            if(data1 < data2) return -1;            if(data1 == data2) data1 = 0;        }        else k=j;        if(version2[k-1] == '.') data2 = 0;        while(version2[k] != '\0' && version2[k] != '.'){            data2 = data2*10 + version2[k]-'0';            k++;        }    }    else if(version1[i] != '\0' && version2[j] == '\0') {        if(version1[i] == '.' ) {            k=i+1;            if(data1 > data2) return 1;            if(data1 < data2) return -1;            if(data1 == data2) data2 = 0;        }        else k=i;        if(version1[k-1] == '.') data1 = 0;        while(version1[k] != '\0' && version1[k] != '.'){            data1 = data1*10 + version1[k]-'0';            k++;        }    }    if(data1 > data2) return 1;    if(data1 < data2) return -1;    if(data1 == data2) return 0;}void main(){    printf("%d\n",compareVersion("1.0","13.37"));}


Compare Version Numbers

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.