Vue3 实现最长递增子序列方法

weixin_39093776

已于 2024-07-17 15:11:18 修改

阅读量126

点赞数 1

分类专栏： vue3 文章标签：前端 vue.js javascript

于 2024-07-17 15:09:13 首次发布

本文链接：https://blog.csdn.net/weixin_39093776/article/details/140495862

版权

vue3 专栏收录该内容

2 篇文章 0 订阅

订阅专栏

function getArray(num) {
    let res = [0]
    let p = num.slice()
    for(let i = 0; i < num.length; i++) {
        if(num[i] < num[res[res.length - 1]]) {
            p[i] = res[res.length - 1]
            res.push(i)
        } else {
            let left = 0, right = res.length
            while(left < right) {
                const mid = left + (right - left >> 1)
                if(num[res[mid]] < num[i]) {
                    left = mid + 1
                } else {
                    right = mid
                }
            }
            if(num[res[left]] > num[i]) {
                res[left] = i
                if(left > 0) {
                   p[i] = left - 1
                }
            }
        }
    }
    
    let u = res.length, v = res[u]
    while(u--) {
        res[u] = v
        v = p[v]
    }
    return res.map(i => num[i])
}