[Swift]LeetCode879. 盈利计划 | Profitable Schemes

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

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

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

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

There are G people in a gang, and a list of various crimes they could commit.

The i-th crime generates a profit[i] and requires group[i] gang members to participate.

If a gang member participates in one crime, that member can't participate in another crime.

Let's call a profitable scheme any subset of these crimes that generates at least Pprofit, and the total number of gang members participating in that subset of crimes is at most G.

How many schemes can be chosen?  Since the answer may be very large, return it modulo 10^9 + 7. 

Example 1:

Input: G = 5, P = 3, group = [2,2], profit = [2,3]
Output: 2
Explanation: 
To make a profit of at least 3, the gang could either commit crimes 0 and 1, or just crime 1.
In total, there are 2 schemes.

Example 2:

Input: G = 10, P = 5, group = [2,3,5], profit = [6,7,8]
Output: 7
Explanation: 
To make a profit of at least 5, the gang could commit any crimes, as long as they commit one.
There are 7 possible schemes: (0), (1), (2), (0,1), (0,2), (1,2), and (0,1,2). 

Note:

1. 1 <= G <= 100
2. 0 <= P <= 100
3. 1 <= group[i] <= 100
4. 0 <= profit[i] <= 100
5. 1 <= group.length = profit.length <= 100

---

帮派里有 G 名成员，他们可能犯下各种各样的罪行。

第 i 种犯罪会产生 profit[i] 的利润，它要求 group[i] 名成员共同参与。

让我们把这些犯罪的任何子集称为盈利计划，该计划至少产生 P 的利润。

有多少种方案可以选择？因为答案很大，所以返回它模 10^9 + 7 的值。 

示例 1：

输入：G = 5, P = 3, group = [2,2], profit = [2,3]
输出：2
解释： 
至少产生 3 的利润，该帮派可以犯下罪 0 和罪 1 ，或仅犯下罪 1 。
总的来说，有两种方案。

示例 2:

输入：G = 10, P = 5, group = [2,3,5], profit = [6,7,8]
输出：7
解释：
至少产生 5 的利润，只要他们犯其中一种罪就行，所以该帮派可以犯下任何罪行 。
有 7 种可能的计划：(0)，(1)，(2)，(0,1)，(0,2)，(1,2)，以及 (0,1,2) 。 

提示：

1. 1 <= G <= 100
2. 0 <= P <= 100
3. 1 <= group[i] <= 100
4. 0 <= profit[i] <= 100
5. 1 <= group.length = profit.length <= 100

---

Runtime: 1032 ms

Memory Usage: 18.8 MB

class Solution {
    func profitableSchemes(_ G: Int, _ P: Int, _ group: [Int], _ profit: [Int]) -> Int {
        var dp:[[Int]] = [[Int]](repeating:[Int](repeating:0,count:G + 1),count:P + 1)
        dp[0][0] = 1
        var res:Int = 0
        var mod:Int = Int(1e9 + 7)
        for k in 0..<group.count
        {
            var g:Int = group[k]
            var p:Int = profit[k]
            for i in stride(from:P,through:0,by:-1)
            {
                for j in stride(from:G - g,through:0,by:-1)
                {
                    dp[min(i + p, P)][j + g] = (dp[min(i + p, P)][j + g] + dp[i][j]) % mod
                }
            }
        }
        for x in dp[P]
        {
            res = (res + x) % mod
        }
        return res
    }
}

---

Runtime: 1192 ms

Memory Usage: 19.4 MB

class Solution {
    func profitableSchemes(_ G: Int, _ P: Int, _ group: [Int], _ profit: [Int]) -> Int {
        guard G >= 1 && G <= 100 && P >= 0 && P <= 100 && group.count >= 1 && group.count <= 100 && group.count == profit.count else {
            return 0
        }
        let mod = Int(1e9 + 7)
        var crimePlanCount = Array(repeating: Array(repeating: 0, count: G + 1), count: P + 1)
        crimePlanCount[0][0] = 1
        for (index, groupValue) in group.enumerated() {
            let profitValue = profit[index]
            for p in stride(from: P, through: 0, by: -1) {
                for g in stride(from: G, through: 0, by: -1) {
                    if groupValue + g > G || crimePlanCount[p][g] == 0 {
                        continue
                    }
                    let targetProfit = min(P, profitValue + p)
                    let targetGroup = groupValue + g
                    crimePlanCount[targetProfit][targetGroup] += crimePlanCount[p][g]
                    crimePlanCount[targetProfit][targetGroup] %= mod
                }
            }
        }
        var result = 0
        for count in crimePlanCount[P] {
            result += count
        }
        return result % mod
    }
}