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

1. 题目

给你一个数组 items ，其中 items[i] = [typei, colori, namei] ，描述第 i 件物品的类型、颜色以及名称。

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

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

ruleKey == "type" 且 ruleValue == typei 。
ruleKey == "color" 且 ruleValue == colori 。
ruleKey == "name" 且 ruleValue == namei 。

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

示例 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 <= typei.length, colori.length, namei.length, ruleValue.length <= 10
ruleKey 等于 "type"、"color" 或 "name"
所有字符串仅由小写字母组成

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/count-items-matching-a-rule
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

2. 解题

• 按题意模拟

class Solution {
public:
    int countMatches(vector<vector<string>>& items, string ruleKey, string ruleValue) {
        int ans = 0, n = items.size();
        for(int i = 0; i < n; i++) {
            if((ruleKey=="type" && ruleValue==items[i][0])
                ||(ruleKey=="color" && ruleValue==items[i][1])
                ||(ruleKey=="name" && ruleValue==items[i][2]))
                ans++;
        }
        return ans;
    }
};

84 ms 30.2 MB C++

---

我的CSDN博客地址 https://michael.blog.csdn.net/

长按或扫码关注我的公众号（Michael阿明），一起加油、一起学习进步！