力扣1773(java&python)-统计匹配检索规则的物品数量（简单）

题目：

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

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

解题思路：

模拟：由于需要由ruleKey来确定 ruleValue的下标，而ruleKey 只能为 "type"、"color" 或 "name"，故直接取ruleKey 的第一个字符来确定items中item的下标，遍历items数组，统计出item[i] == ruleValue的个数，进行返回。

java代码：

class Solution {
    public int countMatches(List<List<String>> items, String ruleKey, String ruleValue) {
        int count = 0;
        int i = ruleKey.charAt(0) == 't'? 0 : (ruleKey.charAt(0) == 'c' ? 1 : 2);
        for(List<String> item : items){
            if(item.get(i).equals(ruleValue)){
                count++;
            }
        }
        return count;
    }
}

 python3代码：

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