题目:
给你一个数组 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"
所有字符串仅由小写字母组成
代码:
int countMatches(char *** items, int itemsSize, int* itemsColSize, char * ruleKey, char * ruleValue){
int res = 0, index = 0;
if (strcmp(ruleKey, "type") == 0) {
index = 0;
} else if (strcmp(ruleKey, "color") == 0) {
index = 1;
} else if (strcmp(ruleKey, "name") == 0) {
index = 2;
}
for (int i = 0; i < itemsSize; i++) {
if (strcmp(items[i][index], ruleValue) == 0) {
res++;
}
}
return res;
}
通过示例1,我们不难可以发现item里面还有一个数据,所以这就是**item的原因
if (strcmp(ruleKey, "type") == 0)
运用了字符串比较函数,这里我们要注意的就是字符串不能直接比较,
strcmp(,)函数 如果后面两个字符串完全一样的话,就会返回0;
if (strcmp(ruleKey, "type") == 0) {
index = 0;
} else if (strcmp(ruleKey, "color") == 0) {
index = 1;
} else if (strcmp(ruleKey, "name") == 0) {
index = 2;
}
首先根据index索引的值来判断一下ruleKey的类型,现在我们就可以判定要查找的是哪一类了,
for (int i = 0; i < itemsSize; i++) {
if (strcmp(items[i][index], ruleValue) == 0) {
res++;
}
}
在根据index的值,利用一个for循环,我们就可以比较出匹配检索规则的物品了,ret++
统计出匹配检索规则的物品数量 。