『LeetCode』1773 统计匹配检索规则的物品数量

题目

1773. 统计匹配检索规则的物品数量

给你一个数组 items ，其中 items[i] = [type^{i}, color^{i}, name^{i}] ，描述第 i 件物品的类型、颜色以及名称。

另给你一条由两个字符串 ruleKey 和 ruleValue 表示的检索规则。

如果第 i 件物品能满足下述条件之一，则认为该物品与给定的检索规则 匹配 ：

• ruleKey == "type" 且 ruleValue == type^{i} 。
• ruleKey == "color" 且 ruleValue == color^{i} 。
• ruleKey == "name" 且 ruleValue == name^{i} 。

统计并返回 匹配检索规则的物品数量 。

示例 1：

输入：items = [["phone","blue","pixel"],["computer","silver","lenovo"],["phone","gold","iphone"]], ruleKey = "color", ruleValue = "silver"
输出：1
解释：只有一件物品匹配检索规则，这件物品是 ["computer","silver","lenovo"] 。

示例 2：

输入：items = [["phone","blue","pixel"],["computer","silver","phone"],["phone","gold","iphone"]], ruleKey = "type", ruleValue = "phone"
输出：2
解释：只有两件物品匹配检索规则，这两件物品分别是 ["phone","blue","pixel"] 和 ["phone","gold","iphone"] 。注意，["computer","silver","phone"] 未匹配检索规则。

提示：

• 1 <= items.length <= 10^{4}
• 1 <= type^{i}.length, color^{i}.length, name^{i}.length, ruleValue.length <= 10
• ruleKey 等于 "type"、"color" 或 "name"
• 所有字符串仅由小写字母组成

标签

数组, 字符串

---

题解

【统计匹配检索规则的物品数量】简单模拟

模拟

遍历&模拟

# Code language: Python
class Solution:
    def countMatches(self, items: List[List[str]], rk: str, rv: str) -> int:
        cnt = 0
        for t, c, n in items:
            if rk == "type" and rv == t:
                cnt += 1
            elif rk == "color" and rv == c:
                cnt += 1
            elif rk == "name" and rv == n:
                cnt += 1
        return cnt

// Code language: C++
class Solution {
public:
    int countMatches(vector<vector<string>>& items, string rk, string rv) {
        int cnt = 0;
        for (auto& it: items) {
            if (rk == "type" && it[0] == rv) ++cnt;
            else if (rk == "color" && it[1] == rv) ++cnt;
            else if (rk == "name" && it[2] == rv) ++cnt;
        }
        return cnt;
    }
};

• 时间复杂度: \(O(n)\)
• 空间复杂度: \(O(1)\)

---

如果对你有帮助的话，请给我点个赞吧~

欢迎前往 我的博客 或 Algorithm - Github 查看更多题解