python-leecode-029统计匹配检测规则的物品数量

最新推荐文章于 2023-03-22 09:59:40 发布

白熊188

最新推荐文章于 2023-03-22 09:59:40 发布

阅读量233

点赞数

分类专栏： leetcode python 文章标签：物品匹配检索规则计数算法 Python实现数据处理

本文链接：https://blog.csdn.net/weixin_43988131/article/details/116188872

版权

python 同时被 2 个专栏收录

73 篇文章 0 订阅

订阅专栏

leetcode

38 篇文章 1 订阅

订阅专栏

029统计匹配检测规则的物品数量

给你一个数组 items ，其中 items[i] = [typei, colori, namei] ，描述第 i 件物品的类型、颜色以及名称。
另给你一条由两个字符串 ruleKey 和 ruleValue 表示的检索规则。
如果第 i 件物品能满足下述条件之一，则认为该物品与给定的检索规则 匹配 ：
ruleKey == "type" 且 ruleValue == typei 。
ruleKey == "color" 且 ruleValue == colori 。
ruleKey == "name" 且 ruleValue == namei 。
统计并返回 匹配检索规则的物品数量 。
输入：items = [["phone","blue","pixel"],["computer","silver","lenovo"],["phone","gold","iphone"]], ruleKey = "color", ruleValue = "silver"
输出：1
解释：只有一件物品匹配检索规则，这件物品是 ["computer","silver","lenovo"] 。

输入：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:
class Solution(object):
    def countMatches(self, items, ruleKey, ruleValue):
        """
        :type items: List[List[str]]
        :type ruleKey: str
        :type ruleValue: str
        :rtype: int
        """
        rule = {
            "type":0,
            "color":1,
            "name":2}
        i = 0
        for item in items:
            if item[rule[ruleKey]] == ruleValue:
                i +=1
        return i