add 1298

Author: luliyucoordinate

README.md

@@ -595,4 +595,5 @@ LeetCode
 |1293|[Shortest Path in a Grid with Obstacles Elimination](https://leetcode.com/problems/shortest-path-in-a-grid-with-obstacles-elimination/)|c|[c++](./src/1293-Shortest-Path-in-a-Grid-with-Obstacles-Elimination/1293.cpp)|[python](./src/1293-Shortest-Path-in-a-Grid-with-Obstacles-Elimination/1293.py)|[go](./src/1293-Shortest-Path-in-a-Grid-with-Obstacles-Elimination/1293.go)|[js](./src/1293-Shortest-Path-in-a-Grid-with-Obstacles-Elimination/1293.js)|[java](./src/1293-Shortest-Path-in-a-Grid-with-Obstacles-Elimination/1293.java)|Hard|
 |1295|[Find Numbers with Even Number of Digits](https://leetcode.com/problems/find-numbers-with-even-number-of-digits/)|c|[c++](./src/1295-Find-Numbers-with-Even-Number-of-Digits/1295.cpp)|[python](./src/1295-Find-Numbers-with-Even-Number-of-Digits/1295.py)|[go](./src/1295-Find-Numbers-with-Even-Number-of-Digits/1295.go)|[js](./src/1295-Find-Numbers-with-Even-Number-of-Digits/1295.js)|[java](./src/1295-Find-Numbers-with-Even-Number-of-Digits/1295.java)|Easy|
 |1296|[Divide Array in Sets of K Consecutive Numbers](https://leetcode.com/problems/divide-array-in-sets-of-k-consecutive-numbers/)|c|[c++](./src/1296-Divide-Array-in-Sets-of-K-Consecutive-Numbers/1296.cpp)|[python](./src/1296-Divide-Array-in-Sets-of-K-Consecutive-Numbers/1296.py)|[go](./src/1296-Divide-Array-in-Sets-of-K-Consecutive-Numbers/1296.go)|[js](./src/1296-Divide-Array-in-Sets-of-K-Consecutive-Numbers/1296.js)|[java](./src/1296-Divide-Array-in-Sets-of-K-Consecutive-Numbers/1296.java)|Medium|
-|1297|[Maximum Number of Occurrences of a Substring](https://leetcode.com/problems/maximum-number-of-occurrences-of-a-substring/)|c|[c++](./src/1297-Maximum-Number-of-Occurrences-of-a-Substring/1297.cpp)|[python](./src/1297-Maximum-Number-of-Occurrences-of-a-Substring/1297.py)|[go](./src/1297-Maximum-Number-of-Occurrences-of-a-Substring/1297.go)|[js](./src/1297-Maximum-Number-of-Occurrences-of-a-Substring/1297.js)|[java](./src/1297-Maximum-Number-of-Occurrences-of-a-Substring/1297.java)|Medium|
+|1297|[Maximum Number of Occurrences of a Substring](https://leetcode.com/problems/maximum-number-of-occurrences-of-a-substring/)|c|[c++](./src/1297-Maximum-Number-of-Occurrences-of-a-Substring/1297.cpp)|[python](./src/1297-Maximum-Number-of-Occurrences-of-a-Substring/1297.py)|[go](./src/1297-Maximum-Number-of-Occurrences-of-a-Substring/1297.go)|[js](./src/1297-Maximum-Number-of-Occurrences-of-a-Substring/1297.js)|[java](./src/1297-Maximum-Number-of-Occurrences-of-a-Substring/1297.java)|Medium|
+|1298|[Maximum Candies You Can Get from Boxes](https://leetcode.com/problems/maximum-candies-you-can-get-from-boxes/)|c|[c++](./src/1298-Maximum-Candies-You-Can-Get-from-Boxes/1298.cpp)|[python](./src/1298-Maximum-Candies-You-Can-Get-from-Boxes/1298.py)|[go](./src/1298-Maximum-Candies-You-Can-Get-from-Boxes/1298.go)|[js](./src/1298-Maximum-Candies-You-Can-Get-from-Boxes/1298.js)|[java](./src/1298-Maximum-Candies-You-Can-Get-from-Boxes/1298.java)|Hard|

src/1298-Maximum-Candies-You-Can-Get-from-Boxes/1298.cpp

@@ -0,0 +1,28 @@
+class Solution 
+{
+public:
+    int maxCandies(vector<int>& status, vector<int>& candies, vector<vector<int>>& keys, vector<vector<int>>& containedBoxes, vector<int>& initialBoxes) 
+    {
+        queue<int> q;
+        for (int i : initialBoxes) q.push(i);
+        int res = 0;
+
+        while (!q.empty())
+        {
+            int changed = 0;
+            for (int q_len = q.size(); q_len > 0; q_len--)
+            {
+                int b = q.front(); q.pop();
+                if (status[b])
+                {
+                    changed = 1;
+                    res += candies[b];
+                    for (int i : containedBoxes[b]) q.push(i);
+                    for (int i : keys[b]) status[i] = 1;
+                } else q.push(b);
+            }
+            if (!changed) return res;
+        }
+        return res;    
+    }
+};

src/1298-Maximum-Candies-You-Can-Get-from-Boxes/1298.go

@@ -0,0 +1,24 @@
+func maxCandies(status []int, candies []int, keys [][]int, containedBoxes [][]int, initialBoxes []int) int {
+    q, res := initialBoxes, 0
+    for len(q) > 0 {
+        changed := false
+        for q_len := len(q); q_len > 0; q_len-- {
+            b := q[0]
+            q = q[1:]
+            if status[b] == 1 {
+                changed = true
+                res += candies[b]
+                q = append(q, containedBoxes[b]...)
+                for _, i := range keys[b] {
+                    status[i] = 1
+                }
+            } else {
+                q = append(q, b)
+            }
+        }
+        if !changed {
+            return res
+        }
+    }
+    return res
+}

src/1298-Maximum-Candies-You-Can-Get-from-Boxes/1298.java

@@ -0,0 +1,22 @@
+class Solution {
+    public int maxCandies(int[] status, int[] candies, int[][] keys, int[][] containedBoxes, int[] initialBoxes) {
+        Queue<Integer> q = new LinkedList();
+        for (int i : initialBoxes) q.offer(i);
+        int res = 0;
+
+        while (!q.isEmpty()) {
+            Boolean changed = false;
+            for (int q_len = q.size(); q_len > 0; q_len--) {
+                int b = q.poll();
+                if (status[b] == 1) {
+                    changed = true;
+                    res += candies[b];
+                    for (int i : containedBoxes[b]) q.offer(i);
+                    for (int i : keys[b]) status[i] = 1;
+                } else q.offer(b);
+            }
+            if (!changed) return res;
+        }
+        return res;
+    }
+}

src/1298-Maximum-Candies-You-Can-Get-from-Boxes/1298.js

@@ -0,0 +1,17 @@
+var maxCandies = function(status, candies, keys, containedBoxes, initialBoxes) {
+    let q = initialBoxes, res = 0;
+    while (q.length > 0) {
+        let changed = false;
+        for (let q_len = q.length; q_len > 0; q_len--) {
+            let b = q.shift();
+            if (status[b] == 1) {
+                changed = true;
+                res += candies[b];
+                q.push(...containedBoxes[b]);
+                for (let i of keys[b]) status[i] = 1;
+            } else q.push(b);
+        }
+        if (!changed) return res;
+    }
+    return res;
+};

src/1298-Maximum-Candies-You-Can-Get-from-Boxes/1298.py

@@ -0,0 +1,19 @@
+class Solution:
+    def maxCandies(self, status: List[int], candies: List[int], keys: List[List[int]], containedBoxes: List[List[int]], initialBoxes: List[int]) -> int:
+        q, res = initialBoxes, 0
+        while q:
+            q_len, changed = len(q), False
+            for _ in range(q_len):
+                b = q.pop(0)
+                if status[b]:
+                    changed = True
+                    res += candies[b]
+                    q += containedBoxes[b]
+                    for i in keys[b]:
+                        status[i] = 1
+                else:
+                    q.append(b)
+
+            if not changed:
+                return res
+        return res

src/addProb.py

@@ -2,10 +2,10 @@
 import os, bisect
 
 # 题目名称
-name = "Maximum Number of Occurrences of a Substring"
-ID = 1297
-url = "https://leetcode.com/problems/maximum-number-of-occurrences-of-a-substring/"
-difficult = "Medium"
+name = "Maximum Candies You Can Get from Boxes"
+ID = 1298
+url = "https://leetcode.com/problems/maximum-candies-you-can-get-from-boxes/"
+difficult = "Hard"
 prog = ['c', 'cpp', 'py', 'go', 'js', 'java']