leetCode 30.Substring with Concatenation of All Words (words中所有子串相连) 解题思路和方法

原创 2015年07月08日 11:11:35

Substring with Concatenation of All Words 


You are given a string, s, and a list of words, words, that are all of the same length. Find all starting indices of substring(s) in s that is a concatenation of each word in words exactly once and without any intervening characters.

For example, given:
s: "barfoothefoobarman"
words: ["foo", "bar"]

You should return the indices: [0,9].

(order does not matter).


思路:leetcode 上有些题通过率低,并不见得是算法难,我觉得很大一部分原因是题目描述不清晰,导致规则理解不透彻,所以编程的时候就会发生规则理解偏差的问题。

本题也是一样,刚一开始对规则理解偏差比较多,以为wors中字符出现在子串中出现一次即可,不管重复还是不重复,但是后面提交不过时,看case完全理解错了规则,只能重新改写代码,很麻烦。

怨言很大,规则制定和说明也是很重要的一点。

代码如下:

public class Solution {
    public List<Integer> findSubstring(String s, String[] words) {
        List<Integer> list = new ArrayList<Integer>();
        if(words.length == 0 || s.length() == 0){
            return list;
        }
        Map<String,Integer> map = new HashMap<String,Integer>();//保存个数以及值
        for(int i = 0; i < words.length; i++){
            if(map.get(words[i]) == null){
            	map.put(words[i],1);//将word保存
            }else{
               map.put(words[i],map.get(words[i])+1);//将word保存的数值+1 
            }
        }
        Map<String,Integer> mapValue = new HashMap<String,Integer>(map);//保存重复的个数,方便重新赋值
        int len = words.length;//去除重复之后的数组长度
        
        int wordLen = words[0].length();
        String temp = "";
        int count = 0;//每个单词出现一次,就记录一次
        for(int i = 0; i <= s.length() - len*wordLen;i++){
        	count = 0;//初始化
            for(int j = 0; j < len;j++){
                temp = s.substring(i + j * wordLen,i + (j+1) * wordLen);//截取wordLen长的字符串
                if(map.get(temp) != null && map.get(temp) != 0){//如果map还有多于0个
                    map.put(temp,map.get(temp)-1);//map中数值减去1
                    count++;//记录数+1
                }else{
                    break;
                }
            }
            if(count == len){//如果记录数与len相等,则说明符合要求
                list.add(i);
            }
            //HashMap重新初始化
            for(String key:map.keySet()){//这样更快速
                map.put(key,mapValue.get(key));
            }
        }
        return list;
    }
}


版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

Leetcode #30. Substring with Concatenation of All Words 连续子串查找 解题报告

1 解题思想题目说给了一个原串,然后给了一组单词,让你从这个原串当中找一个区间,这个区间正好包含了这些所有的单词,不能交叉,不能有多余的值这道题是我在Leetcode 刷的最艰辛的一道题,我可能不适合...

[理解leetcode解法]30. Substring with Concatenation of All Words找子串

[理解leetcode解法]30. Substring with Concatenation of All Words找子串

LeetCode 30 Substring with Concatenation of All Words(与所有文字串联子串)(*)

翻译给定一个字符串S,一个单词的列表words,全是相同的长度。找到的子串(多个)以s即每个词的字串联恰好一次并没有任何插入的字符所有的起始索引。原文You are given a string, s...
  • NoMasp
  • NoMasp
  • 2015-11-18 21:30
  • 1979

[Leetcode] 30. Substring with Concatenation of All Words 解题报告

题目: You are given a string, s, and a list of words, words, that are all of the same length. Find a...

LeetCode | Substring with Concatenation of All Words(链接所有单词的子串)

You are given a string, S, and a list of words, L, that are all of the same length. Find all startin...

【LeetCode-面试算法经典-Java实现】【030-Substring with Concatenation of All Words(串联所有单词的子串)】

【030-Substring with Concatenation of All Words(串联所有单词的子串)】【LeetCode-面试算法经典-Java实现】【所有题目目录索引】原题  You ...

[LeetCode] 30. Substring with Concatenation of All Words

leetcode string

Leetcode||30.Substring with Concatenation of All Words

30. Substring with Concatenation of All Words Total Accepted: 68319Total Submi...

LeetCode 30 Substring with Concatenation of All Words (C,C++,Java,Python)

Problem: You are given a string, s, and a list of words, words, that are all of the same length...

LeetCode 30 - Substring with Concatenation of All Words

一、问题描述 Description:Description: You are given a string, ss, and a list of words, wordswords, ...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)