LeetCode 771. Jewels and Stones--Java和Python解法--简单

题目地址：Jewels and Stones - LeetCode

You’re 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.

你会得到J代表珠宝类型的字符串，S代表你拥有的宝石。每个角色S都是你拥有的一种石头。你想知道你有多少宝石也是珠宝。

在这些信件J是保证不同，而在所有的字符J和S是字母。字母区分大小写，因此"a"被认为是不同类型的石头"A"。

python代码如下：

class Solution:def numJewelsInStones(self, J: str, S: str) -> int:count=0for i in S:if i in J:count+=1return count

Java代码如下：

class Solution {public int numJewelsInStones(String J, String S) {int count = 0;for (char s: S.toCharArray()) {if (J.contains(""+s)){count+=1;}}return count;}
}

LeetCode 771. Jewels and Stones--Java和Python解法--简单相关推荐

LeetCode - 771. Jewels and Stones
题目 You're given strings J representing the types of stones that are jewels, and S representing the s ...
LeetCode 136. Single Number--异或--Java,C++,Python解法
题目地址:Single Number - LeetCode Given a non-empty array of integers, every element appears twice excep ...
【博客搬家旧文】leetcode 771. Jewels and Stones
今天开通了博客园 ,之前的博客就不用了.之后再陆陆续续把之前的博文重新放到这里来.有标题这个tag的都是搬运的旧博客的文章.希望在这里是个新的开始,嘻嘻. import java.util.Scann ...
Leetcode 771. Jewels and Stones
class Solution(object):def numJewelsInStones(self, J, S):""":type J: str:type S: str: ...
LeetCode 316. Remove Duplicate Letters--贪心--Java,C++,Python解法
题目地址:Number of Longest Increasing Subsequence - LeetCode 做这道题目前建议先做:Longest Increasing Subsequence - ...
LeetCode 673. Number of Longest Increasing Subsequence--O(N log N )--Java,C++,Python解法
题目地址:Number of Longest Increasing Subsequence - LeetCode 做这道题目前建议先做:Longest Increasing Subsequence - ...
LeetCode 159. Longest Substring with At Most Two Distinct Characters --Java,C++,Python解法
题目地址:Longest Substring with At Most Two Distinct Characters - LeetCode Given a string s , find the l ...
LeetCode 746. Min Cost Climbing Stairs--动态规划--Java,C++,Python解法
题目地址:Min Cost Climbing Stairs - LeetCode LeetCode 动态规划(Dynamic programming)系列题目:LeetCode 动态规划(Dynami ...
LeetCode 122. Best Time to Buy and Sell Stock II--贪心--Java,C++,Python解法
题目地址:Best Time to Buy and Sell Stock II - LeetCode Say you have an array for which the ith element i ...

LeetCode 771. Jewels and Stones--Java和Python解法--简单

LeetCode 771. Jewels and Stones--Java和Python解法--简单相关推荐

最新文章

热门文章