统计匹配检索规则的物品数量
给你一个数组 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 <= 104
1 <= typei.length, colori.length, namei.length, ruleValue.length <= 10
ruleKey
等于"type"
、"color"
或"name"
- 所有字符串仅由小写字母组成
解题思路
看着题目那么长,但其实读懂之后也挺简单的…
题目会给一个数组,描述多件物品的类型、颜色以及名称
还会给检索的规则
如:ruleKey == "type"则是检索type,ruleValue == phone。则要检索是否有type 为 phone的这样一件物品。统计符合检索要求的物品数量。
作者思路是设定一个key变量,用来存放要求检索的ruleKey,类型、颜色、名称分别用0,1,2来代替。
接下来循环遍历题目所给的数组,进行判断,看下标为key的数组的值是否为题目要求的 ruleValue。若是,则count++。
题解如下:
class Solution{
public:
int countMatches(vector<vector<string>>& items, string ruleKey, string ruleValue){
int key = 0;
if(ruleKey == "type"){
key = 0;
} else if(ruleKey == "color"){
key = 1;
} else {
key = 2;
}
int count = 0;
for(int i = 0; i < items.size(); i++){
if(items[i][key] == ruleValue){
count++;
}
}
return count;
}
}
加油加油,又水了一道…