[Swift]LeetCode491. 递增子序列 | Increasing Subsequences

★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★
➤微信公众号：山青咏芝（shanqingyongzhi）
➤博客园地址：山青咏芝（https://www.cnblogs.com/strengthen/）
➤GitHub地址：https://github.com/strengthen/LeetCode
➤原文地址：https://www.cnblogs.com/strengthen/p/10348625.html 
➤如果链接不是山青咏芝的博客园地址，则可能是爬取作者的文章。
➤原文已修改更新！强烈建议点击原文地址阅读！支持作者！支持原创！
★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★

热烈欢迎，请直接点击！！！

进入博主App Store主页，下载使用各个作品！！！

注：博主将坚持每月上线一个新app！！！

Given an integer array, your task is to find all the different possible increasing subsequences of the given array, and the length of an increasing subsequence should be at least 2 .

Example:

Input: [4, 6, 7, 7]
Output: [[4, 6], [4, 7], [4, 6, 7], [4, 6, 7, 7], [6, 7], [6, 7, 7], [7,7], [4,7,7]] 

Note:

1. The length of the given array will not exceed 15.
2. The range of integer in the given array is [-100,100].
3. The given array may contain duplicates, and two equal integers should also be considered as a special case of increasing sequence.

---

给定一个整型数组, 你的任务是找到所有该数组的递增子序列，递增子序列的长度至少是2。

示例:

输入: [4, 6, 7, 7]
输出: [[4, 6], [4, 7], [4, 6, 7], [4, 6, 7, 7], [6, 7], [6, 7, 7], [7,7], [4,7,7]]

说明:

1. 给定数组的长度不会超过15。
2. 数组中的整数范围是 [-100,100]。
3. 给定数组中可能包含重复数字，相等的数字应该被视为递增的一种情况。

---

Runtime: 472 ms

Memory Usage: 17.3 MB

class Solution {
    func findSubsequences(_ nums: [Int]) -> [[Int]] {
        var res:Set<[Int]> = Set<[Int]>()
        var cur:[[Int]] = [[]]
        for i in 0..<nums.count
        {
            var n:Int = cur.count
            for j in 0..<n
            {
                if !cur[j].isEmpty && cur[j].last! > nums[i]
                {
                    continue
                }
                cur.append(cur[j])
                cur[cur.count - 1].append(nums[i])
                if cur[cur.count - 1].count >= 2
                {
                    res.insert(cur.last!)
                }
            }
        }
        return [[Int]](res)
    }
}

---

15810 kb

class Solution {
    func findSubsequences(_ nums: [Int]) -> [[Int]] {
        guard nums.count > 0 else { return [[Int]]() }
        
        var visit = [Bool](repeating: false, count: nums.count)
        var res = [[Int]]()
        
        dfs(nums, 0, &res, &visit, getPrev(nums), [Int]())
        
        return res
    }
    
    private func dfs(_ nums: [Int], _ index: Int, _ res: inout [[Int]], _ visit: inout [Bool], _ prev: [Int], _ list: [Int]) {
        if list.count > 1 {
            res.append(list)
        }
        
        var list = list
        
        for i in index..<nums.count {
            if index >= 1, nums[i] < nums[index-1] {
                continue
            }
            
            if prev[i] != -1, visit[prev[i]] == false, (list.count == 0 || prev[i] > index-1) {
                continue
            } 
            
            list.append(nums[i])
            visit[i] = true
            dfs(nums, i+1, &res, &visit, prev, list)
            visit[i] = false
            list.removeLast()
        }
    }
    
    private func getPrev(_ nums: [Int]) -> [Int] {
        var map = [Int: Int]()
        var prev = [Int](repeating: -1, count: nums.count)
        
        for i in 0..<nums.count {
            if let value = map[nums[i]] {
                prev[i] = value
            } 
            map[nums[i]] = i
        }
        
        return prev
    }
}