count-items-matching-a-rule

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

You are given an array <code>items</code>, where each <code>items[i] = [typei, colori, namei]</code> describes the type, color, and name of the <code>ith</code> item. You are also given a rule represented by two strings, <code>ruleKey</code> and <code>ruleValue</code>.

The <code>ith</code> item is said to match the rule if one of the following is true:

<ul>
	<li><code>ruleKey == &quot;type&quot;</code> and <code>ruleValue == typei</code>.</li>
	<li><code>ruleKey == &quot;color&quot;</code> and <code>ruleValue == colori</code>.</li>
	<li><code>ruleKey == &quot;name&quot;</code> and <code>ruleValue == namei</code>.</li>
</ul>

Return the number of items that match the given rule.

&nbsp;
Example 1:

<pre>
Input: items = [[&quot;phone&quot;,&quot;blue&quot;,&quot;pixel&quot;],[&quot;computer&quot;,&quot;silver&quot;,&quot;lenovo&quot;],[&quot;phone&quot;,&quot;gold&quot;,&quot;iphone&quot;]], ruleKey = &quot;color&quot;, ruleValue = &quot;silver&quot;
Output: 1
Explanation: There is only one item matching the given rule, which is [&quot;computer&quot;,&quot;silver&quot;,&quot;lenovo&quot;].
</pre>

Example 2:

<pre>
Input: items = [[&quot;phone&quot;,&quot;blue&quot;,&quot;pixel&quot;],[&quot;computer&quot;,&quot;silver&quot;,&quot;phone&quot;],[&quot;phone&quot;,&quot;gold&quot;,&quot;iphone&quot;]], ruleKey = &quot;type&quot;, ruleValue = &quot;phone&quot;
Output: 2
Explanation: There are only two items matching the given rule, which are [&quot;phone&quot;,&quot;blue&quot;,&quot;pixel&quot;] and [&quot;phone&quot;,&quot;gold&quot;,&quot;iphone&quot;]. Note that the item [&quot;computer&quot;,&quot;silver&quot;,&quot;phone&quot;] does not match.</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= items.length &lt;= 104</code></li>
	<li><code>1 &lt;= typei.length, colori.length, namei.length, ruleValue.length &lt;= 10</code></li>
	<li><code>ruleKey</code> is equal to either <code>&quot;type&quot;</code>, <code>&quot;color&quot;</code>, or <code>&quot;name&quot;</code>.</li>
	<li>All strings consist only of lowercase letters.</li>
</ul>

countMatches

Count Items Matching a Rule

Array

String

给你一个数组 <code>items</code> ，其中 <code>items[i] = [typei, colori, namei]</code> ，描述第 <code>i</code> 件物品的类型、颜色以及名称。

另给你一条由两个字符串 <code>ruleKey</code> 和 <code>ruleValue</code> 表示的检索规则。

如果第 <code>i</code> 件物品能满足下述条件之一，则认为该物品与给定的检索规则 匹配 ：

<ul>
	<li><code>ruleKey == "type"</code> 且 <code>ruleValue == typei</code> 。</li>
	<li><code>ruleKey == "color"</code> 且 <code>ruleValue == colori</code> 。</li>
	<li><code>ruleKey == "name"</code> 且 <code>ruleValue == namei</code> 。</li>
</ul>

统计并返回 匹配检索规则的物品数量 。

 

示例 1：

<pre>
输入：items = [["phone","blue","pixel"],["computer","silver","lenovo"],["phone","gold","iphone"]], ruleKey = "color", ruleValue = "silver"
输出：1
解释：只有一件物品匹配检索规则，这件物品是 ["computer","silver","lenovo"] 。
</pre>

示例 2：

<pre>
输入：items = [["phone","blue","pixel"],["computer","silver","phone"],["phone","gold","iphone"]], ruleKey = "type", ruleValue = "phone"
输出：2
解释：只有两件物品匹配检索规则，这两件物品分别是 ["phone","blue","pixel"] 和 ["phone","gold","iphone"] 。注意，["computer","silver","phone"] 未匹配检索规则。</pre>

 

提示：

<ul>
	<li><code>1 <= items.length <= 104</code></li>
	<li><code>1 <= typei.length, colori.length, namei.length, ruleValue.length <= 10</code></li>
	<li><code>ruleKey</code> 等于 <code>"type"</code>、<code>"color"</code> 或 <code>"name"</code></li>
	<li>所有字符串仅由小写字母组成</li>
</ul>