Word Break/Word Segment

來源:互聯網
上載者:User

標籤:style   blog   color   os   art   cti   

Given a string s and a dictionary of words dict, determine if s can be segmented into a space-separated sequence of one or more dictionary words.

For example, given
s = "leetcode",
dict = ["leet", "code"].

Return true because "leetcode" can be segmented as "leet code".

Dynamic programming。用一個table記錄下0~i-1是否符合要求。注意一開始的table[0]=true,以及table長度為輸入字串長度加一。Loop 0~s.length()-1,只能從table[i]=true的地方開始,因為那之前都是匹配的才能接著匹配。

public class Solution {    public boolean wordBreak(String s, Set<String> dict) {        int strlen=s.length();        boolean [] table=new boolean[strlen+1];        table[0]=true;//begin is always true, so we can start the loop        for(int i=0;i<strlen;i++){            if(!table[i])// 0~i-1 are not words                continue;            for(String word: dict){                int len=word.length();                int end=i+len-1;                if(end>strlen-1)                    continue;                if(table[end+1])//already match at this position                    continue;                if(s.substring(i,end+1).equals(word)){                    table[end+1]=true;                }            }        }        return table[strlen];    }}

 

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.