leetcode 383. Ransom Note

public class Solution {
public boolean canConstruct(String ransomNote, String magazine) {
int[] alphabet1 = new int[26];
int[] alphabet2 = new int[26];

for (char c: ransomNote.toCharArray())
alphabet1[(int)(c-'a')] ++;
for (char c: magazine.toCharArray())
alphabet2[(int)(c-'a')] ++;
int i = 0;
for(; i<26; i++)
if (alphabet1[i]>alphabet2[i])
break;
if (i>=26)
return true;
return false;
}
}