标题链接：https://leetcode.cn/problems/count-items-matching-a-rule/
标题形貌：
给你一个数组 items ，此中 items = [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 <= 104
- 1 <= typei.length, colori.length, namei.length, ruleValue.length <= 10
- ruleKey 便是 "type"、"color" 或 "name"
- 全部字符串仅由小写字母构成
解法：模仿
先根据ruleKey来获取必要匹配的物品特性下标，在遍历物品列表，判断其对应特性是否满足条件。
代码： |
