内容简介：You are given strings J representing the types of stones that are jewels, and S representing the stones you have. Each character in S is a type of stone you have. You want to know how many of the stones you have are also jewels.The letters in J are guaran
You are given strings J representing the types of stones that are jewels, and S representing the stones you have. Each character in S is a type of stone you have. You want to know how many of the stones you have are also jewels.
The letters in J are guaranteed distinct, and all characters in J and S are letters. Letters are case sensitive, so “a” is considered a different type of stone from “A”.
Example 1:
Input: J = “aA”, S = “aAAbbbb”
Output: 3
Example 2:
Input: J = “z”, S = “ZZ”
Output: 0
Note:
S and J will consist of letters and have length at most 50.
The characters in J are distinct.
return J.reduce(0) { sum, j in
sum + S.filter({$0 == j}).count
}
（随着网站访问量的激增，服务器配置只得一再升级以维持网站不“404 Not Found”，所以网站的维护费用也在不断上涨……（目前的阿里云服务器ECS+云数据库RDS+域名购买+七牛云的费用是2200元/年），为了能不放弃该网站，所以我又把打赏链接放上来啦～所有打赏金额都会被记账并投入博客维护中，感谢厚爱，多多关照～）
以上就是本文的全部内容，希望本文的内容对大家的学习或者工作能带来一定的帮助，也希望大家多多支持 码农网
猜你喜欢:
本站部分资源来源于网络，本站转载出于传递更多信息之目的，版权归原作者或者来源机构所有，如转载稿涉及版权问题，请联系我们。
