Shulou(Shulou.com)06/03 Report--

This article mainly explains "how to realize effective letter heterotopic words". The explanation content in this article is simple and clear, easy to learn and understand. Please follow the idea of Xiaobian and go deep into it slowly to study and learn "how to realize effective letter heterotopic words" together.

Given two strings s and t, write a function to determine whether t is a letter heterotopic of s. example

Example 1: Input: s = "anagram", t = "nagaram" Output: true Example 2: Input: s = "rat", t = "car" Output: false Note: You can assume that the string contains only lowercase letters.

problem-solving

Method 1: Hash map only lowercase letters can create an array of length 26, traverse s and t, while adding s, while subtracting t, if s and t are letter heterotopic words, then the final array which bit is 0.

class Solution { public boolean isAnagram(String s, String t) { if(s.length()!= t.length()){ return false; } int[] zi=new int[26]; for(int i=0;i

Welcome to subscribe "Shulou Technology Information " to get latest news, interesting things and hot topics in the IT industry, and controls the hottest and latest Internet news, technology news and IT industry trends.