@@ -0,0 +1,1582 @@
+package leetcode.oj.interLeavingString;%0A%0A/**%0A * Created by mark on 2/11/14.%0A */%0A%0A//http://oj.leetcode.com/problems/interleaving-string/%0A%0Apublic class Solution %7B%0A    public boolean isInterleave(String s1, String s2, String s3) %7B%0A%0A        boolean%5B%5D bool = new boolean%5Bs3.length()%5D;%0A%0A        for (int i = 0; i %3C s1.length(); i++) %7B%0A            boolean found = false;%0A            for (int j = 0; j %3C s3.length(); j++) %7B%0A                if (s1.charAt(i) == s3.charAt(j)) %7B%0A                    if (bool%5Bj%5D == false) %7B%0A                        bool%5Bj%5D = true;%0A                        found = true;%0A                        break;%0A                    %7D else %7B%0A                        continue;%0A                    %7D%0A                %7D%0A            %7D%0A%0A            if (!found)%0A                return false;%0A%0A        %7D%0A%0A        for (int i = 0; i %3C s2.length(); i++) %7B%0A            boolean found = false;%0A            for (int j = 0; j %3C s3.length(); j++) %7B%0A                if (s2.charAt(i) == s3.charAt(j)) %7B%0A                    if (bool%5Bj%5D == false) %7B%0A                        bool%5Bj%5D = true;%0A                        found = true;%0A                        break;%0A                    %7D else %7B%0A                        continue;%0A                    %7D%0A                %7D%0A            %7D%0A%0A            if (!found)%0A                return false;%0A        %7D%0A%0A        for (boolean b : bool) %7B%0A            if (b == false)%0A                return false;%0A        %7D%0A%0A        return true;%0A    %7D%0A%0A    public static void main(String%5B%5D args) %7B%0A        System.out.println(new Solution().isInterleave(%22a%22, %22b%22, %22a%22));%0A    %7D%0A%7D

add solution