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

• 题目：给你一个数组 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. 1 <= items.length <= 104
2. 1 <= typei.length, colori.length, namei.length, ruleValue.length <= 10
3. ruleKey 等于 "type"、"color" 或 "name"
4. 所有字符串仅由小写字母组成

• 思路：

设置一个tag值来存储是哪列
定义一个数组和m值分别用来存储结果包含的列数和行数遍历
进行行遍历，若目标值所在的行数是类型值所在的行数就将这个行数存储到res中
返回res的长度

• 解法一：

class Solution:
    def countMatches(self, items: List[List[str]], ruleKey: str, ruleValue: str) -> int:
        if ruleKey == "type":
            tag = 0
        elif ruleKey == "color":
            tag = 1
        else:
            tag = 2
        res, m = [], 0
        for i in items:
            if i[tag] == ruleValue:
                res.append(m)
            m += 1
        return len(res)

• 解法一：

class Solution:
    def countMatches(self, items: List[List[str]], ruleKey: str, ruleValue: str) -> int:
        count = 0
        for item in items:
            if ruleKey == "type" and ruleValue == item[0]:
                count += 1
            if ruleKey == "color" and ruleValue == item[1]:
                count += 1
            if ruleKey == "name" and ruleValue == item[2]:
                count += 1
        return count

---

1. 来源：力扣（LeetCode）
   链接：https://leetcode-cn.com/problems/count-items-matching-a-rule ↩︎