Leetcode383. Ransom Note

一、题目

Given an arbitrary ransom note string and another string containing letters from all the magazines, write a function that will return true if the ransom note can be constructed from the magazines ; otherwise, it will return false.

Each letter in the magazine string can only be used once in your ransom note.

Note:
You may assume that both strings contain only lowercase letters.

canConstruct("a", "b") -> false
canConstruct("aa", "ab") -> false
canConstruct("aa", "aab") -> true

二、思路

从中查找元素，看是否都出现过，对于ransomNote里每个字符出现的次数必须小于或者等于该字符在magazine出现的次数。

1、先将字符串转换为数组

2、将数组排序

3、使用两个指针分别指向两个数组，进行遍历
三、代码

public class Solution {
    public boolean canConstruct(String ransomNote, String magazine) {
 char[]ra=ransomNote.toCharArray();
char[]ma=magazine.toCharArray();
Arrays.sort(ra);
Arrays.sort(ma);
int i=0;
int j=0;
while(i<ra.length&&j<ma.length){
if(ra[i]==ma[j])
i++;
j++;
}
if(i==ra.length)
return true;
else 
return false;
    }
}