165. Compare Version Numbers

本文介绍了一种用于比较软件版本号的算法实现,并提供了两种清晰易懂的Java代码示例,帮助开发者快速理解并应用到实际项目中。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

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

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

我的解法:

public class Solution {
    public int compareVersion(String version1, String version2) {
        if (version1 == "." || version2 == ".") {
            return 0;
        }
        String[] strs1 = version1.split("\\.");
        String[] strs2 = version2.split("\\.");
        int i = 0;
        while (i < strs1.length) {
            if (i < strs2.length) {
                if (Integer.parseInt(strs1[i]) > Integer.parseInt(strs2[i])) {
                    return 1;
                } else if (Integer.parseInt(strs1[i]) < Integer.parseInt(strs2[i])) {
                    return -1;
                }
            } else if (Integer.parseInt(strs1[i]) > 0) {
                return 1;
            }
            i ++;
        }
        if (i < strs2.length) {
            while (i < strs2.length) {
                if (Integer.parseInt(strs2[i]) > 0) {
                    return -1;
                }
                i ++;
            }
        }
        return 0;
    }
}
1、以"."分隔字符串

2、逐个比较字符转化成的int

3、version1 > version2 返回 1,  version1 < version2 返回 -1, 否则返回 0.

笔记:string 转 int 可以用 Integer.parseInt(str)

更清晰解法:

public int compareVersion(String version1, String version2) {
    String[] levels1 = version1.split("\\.");
    String[] levels2 = version2.split("\\.");
    
    int length = Math.max(levels1.length, levels2.length);
    for (int i=0; i<length; i++) {
    	Integer v1 = i < levels1.length ? Integer.parseInt(levels1[i]) : 0;
    	Integer v2 = i < levels2.length ? Integer.parseInt(levels2[i]) : 0;
    	int compare = v1.compareTo(v2);
    	if (compare != 0) {
    		return compare;
    	}
    }
    
    return 0;
}
之前在纠结如果两个字符串长度不同,怎么在一个字符串数组超界之后,自动用 0 去跟另一个数组的数比较。

上面的解法,最外面循环用较大的长度,循环内每一次新建两个数,如果超界,就赋值 0。

笔记:Integer.compareTo() 的返回值 v1 > v2  1, v1 = v2  0, v1 < v2  -1

### Goroutines and Channel Output Comparison In the context of concurrent programming using Go language, goroutines provide an efficient way to execute functions concurrently. By prefixing a function call with `go`, this operation runs asynchronously in a separate goroutine without blocking the main program flow[^1]. When comparing outputs related to channels (`ch1`), consider how data flows between different parts of a program through these communication primitives. Channels allow safe sharing of values across multiple goroutines. #### Example Demonstrating Concurrent Execution Using Goroutines Below demonstrates sending messages over channel `ch1`. One version uses direct synchronous calls while another employs asynchronous execution via goroutines: ```go package main import ( "fmt" ) func sendDirect(ch chan int) { for i := 0; i < 5; i++ { ch <- i * 2 // Send even numbers directly into ch1 synchronously } close(ch) } func sendAsync(ch chan int) { go func() { // Run as goroutine for i := 0; i < 5; i++ { ch <- i * 3 // Send multiples of three into ch1 asynchronously } close(ch) }() } func main() { fmt.Println("Synchronous:") directCh := make(chan int) sendDirect(directCh) for v := range directCh { fmt.Printf("%d ", v) } fmt.Println("\nAsynchronous:") asyncCh := make(chan int) sendAsync(asyncCh) for v := range asyncCh { fmt.Printf("%d ", v) } } ``` This code snippet shows two methods for populating `ch1`: one performs operations sequentially within the same thread, whereas the other leverages concurrency by launching tasks inside independent lightweight threads known as goroutines.
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值