摘要:解题思路,就是只顺序不同但个数相同的字符串,那我们就可以利用的思想来比较每个字符串中字符出现的个数是否相等。
Find All Anagrams in a String
Given a string s and a non-empty string p, find all the start indices of p"s anagrams in s.
Strings consists of lowercase English letters only and the length of both strings s and p will not be larger than 20,100.
The order of output does not matter.
Example 1: Input: s: "cbaebabacd" p: "abc" Output: [0, 6] Explanation: The substring with start index = 0 is "cba", which is an anagram of "abc". The substring with start index = 6 is "bac", which is an anagram of "abc". Example 2: Input: s: "abab" p: "ab" Output: [0, 1, 2] Explanation: The substring with start index = 0 is "ab", which is an anagram of "ab". The substring with start index = 1 is "ba", which is an anagram of "ab". The substring with start index = 2 is "ab", which is an anagram of "ab".
1.解题思路
anagrams,就是只顺序不同但个数相同的字符串,那我们就可以利用hashtable的思想来比较每个字符串中字符出现的个数是否相等。
对于两个字符串我们分别准备数组(大小为256)来存储每个字符出现的次数:
1) 对于p,我们遍历,并在hp中记录字符出现的次数;
2) 之后遍历s,先把当前字符的个数+1,但是需要考虑当前index是否已经超过了p的长度,如果超过,则表示前面的字符已经不予考虑,所以要将index-plen的字符的个数-1;最后判断两个数组是否相等,如果相等,返回index-plen+1,即为开始的下标。
2.代码
public class Solution { public ListfindAnagrams(String s, String p) { List res=new ArrayList (); if(s.length()==0||s==null||p.length()==0||p==null) return res; int[] hs=new int[256]; int[] hp=new int[256]; int plen=p.length(); for(int i=0;i =plen){ hs[s.charAt(j-plen)]--; } if(Arrays.equals(hs,hp)) res.add(j-plen+1); } return res; } }
文章版权归作者所有,未经允许请勿转载,若此文章存在违规行为,您可以联系管理员删除。
转载请注明本文地址:https://www.ucloud.cn/yun/69799.html
摘要:题目要求思路和代码这是一个简单的双指针问题,即左指针指向可以作为起点的子数组下标,右指针则不停向右移动,将更多的元素囊括进来,从而确保该左右指针内的元素是目标数组的一个兄弟子数组即每个字母的个数均相等左指针记录每个字母出现的次数拷贝一个 题目要求 Given a string s and a non-empty string p, find all the start indices ...
Problem Given a string s and a non-empty string p, find all the start indices of ps anagrams in s. Strings consists of lowercase English letters only and the length of both strings s and p will not be...
Problem Given an array of strings, group anagrams together. Example: Input: [eat, tea, tan, ate, nat, bat], Output: [ [ate,eat,tea], [nat,tan], [bat] ] Note: All inputs will be in lowercase.The ...
摘要:同时使用方法将数组转化为并利用的直接比较两个字符串是否相等。通过这种方法效率值提高了不少。 题目要求 Given an array of strings, group anagrams together. For example, given: [eat, tea, tan, ate, nat, bat], Return: [ [ate, eat,tea], [nat,t...
摘要:在线网站地址我的微信公众号完整题目列表从年月日起,每天更新一题,顺序从易到难,目前已更新个题。这是项目地址欢迎一起交流学习。 这篇文章记录我练习的 LeetCode 题目,语言 JavaScript。 在线网站:https://cattle.w3fun.com GitHub 地址:https://github.com/swpuLeo/ca...我的微信公众号: showImg(htt...
阅读 3681·2021-11-24 09:39
阅读 1832·2021-11-16 11:45
阅读 580·2021-11-16 11:45
阅读 994·2021-10-11 10:58
阅读 2432·2021-09-09 11:51
阅读 1915·2019-08-30 15:54
阅读 652·2019-08-29 13:13
阅读 3435·2019-08-26 12:18