LeetCode算法入門- Compare Version Numbers -day14

題目描述：
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.

You may assume the default revision number for each level of a version number to be 0. For example, version number 3.4 has a revision number of 3 and 4 for its first and second level revision number. Its third and fourth level revision number are both 0.

Example 1:

Input: version1 = “0.1”, version2 = “1.1”
Output: -1

Example 2:

Input: version1 = “1.0.1”, version2 = “1”
Output: 1

Example 3:

Input: version1 = “7.5.2.4”, version2 = “7.5.3”
Output: -1

Example 4:

Input: version1 = “1.01”, version2 = “1.001”
Output: 0
Explanation: Ignoring leading zeroes, both “01” and “001" represent the same number “1”

Example 5:

Input: version1 = “1.0”, version2 = “1.0.0”
Output: 0
Explanation: The first version number does not have a third level revision number, which means its third level revision number is default to “0”

Note:

Version strings are composed of numeric strings separated by dots . and this numeric strings may have leading zeroes.
Version strings do not start or end with dots, and they will not be two consecutive dots.

題意分析：

該題目的意思是比較【版本號(hào)】。版本號(hào)只是有“數(shù)字”和”.“組成

if version1 > version2 return 1
if version1 < version2 return -1
其他情況返回0.

Java實(shí)現(xiàn)：
方法一：通過(guò)split函數(shù)分割開(kāi)，然后將其轉(zhuǎn)換為int類型，然后一一進(jìn)行比較

class Solution {public int compareVersion(String version1, String version2) {//進(jìn)行分割，.*|分割的時(shí)候要加上\\String[] str1 = version1.split("\\.");String[] str2 = version2.split("\\.");//取最長(zhǎng)的字符串作為基準(zhǔn)int maxLen = Math.max(str1.length , str2.length);for(int i = 0; i < maxLen; i++){int temp1 = 0; int temp2 = 0;if(i < str1.length){temp1 = Integer.parseInt(str1[i]);}if(i < str2.length){temp2 = Integer.parseInt(str2[i]);}if(temp1 < temp2)return -1;else if(temp1 > temp2)return 1;}return 0;} }

方法二，也可以不使用split函數(shù)，直接循環(huán)判斷字符串的方法，如果為“.”，則向右移動(dòng)，單個(gè)單個(gè)進(jìn)行比較

class Solution {public int compareVersion(String version1, String version2) {int i = 0;int j = 0;while(i < version1.length() || j <version2.length()){int temp1 = 0;int temp2 = 0;//如果指向.的話，i++，向右移動(dòng)while(i < version1.length() && version1.charAt(i) != '.'){//以防版本號(hào)為兩位數(shù)11.1.2temp1 = temp1 * 10 + (version1.charAt(i) - '0');i++;}i++;while(j < version2.length() && version2.charAt(j) != '.'){//通過(guò)(version2.charAt(j) - '0')來(lái)獲取其int值temp2 = temp2 * 10 + (version2.charAt(j) - '0');j++;}j++;if(temp1 > temp2)return 1;else if(temp1 < temp2){return -1;}}return 0;} }

總結(jié)

以上是生活随笔為你收集整理的LeetCode算法入门- Compare Version Numbers -day14的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問(wèn)題。

如果覺(jué)得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。