@@ -0,0 +1,821 @@
+// 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.%0A%0A// For example, given%0A// s = %22leetcode%22,%0A// dict = %5B%22leet%22, %22code%22%5D.%0A%0A// Return true because %22leetcode%22 can be segmented as %22leet code%22.%0A%0Apublic class Solution %7B%0A    public boolean wordBreak(String s, Set%3CString%3E dict) %7B%0A    %09if(s.length() %3C 1) return false;%0A%0A        boolean%5B%5D splitPoint = new boolean%5Bs.length() + 1%5D;%0A        splitPoint%5B0%5D = true;%0A%0A        for(int i = 0; i %3C= s.length(); i++)%7B%0A        %09for(int j = 0; j %3C i; j++)%7B%0A        %09%09String subString = s.substring(j, i);%0A        %09%09if(splitPoint%5Bj%5D && dict.contains(subString))%7B%0A        %09%09%09splitPoint%5Bi%5D = true;%0A        %09%09%09break;%0A        %09%09%7D%0A        %09%7D%0A        %7D %0A%0A        return splitPoint%5Bs.length()%5D;%0A    %7D%0A%7D

add word break i solution