package lintcode;

/**
 * Created by Dell on 2017-08-29.
 */
public class Main {
    public static void main(String[] args){
        //交叉字符串
//        boolean res=new InterLeave().isInterleave("asdfjopufaaf;lasnopfodifa;djfal;sfjdsf","adlkjfoqweijzdkj;ljfeowfjl;djfnd","asdfjopufaaf;lasnopfodadlkjfoqweijzdkj;ljfeowfjl;djfneifa;djfal;sfjdsf");
//        System.out.println(res);
        //LICS
//        int[] arr={5,4,2,1,3};
//        int res=new LICS().longestIncreasingContinuousSubsequence(arr);
//        System.out.println(res);
        //editDistance
//        new EditDistance119().minDistance("a","a");
        //猜数
//        new GuessGame666().getMoneyAmount(4);
        //最大可整除子集
//        int[] arr={1,2,4};
//        new LargestDividibleSubsets603().largestDivisibleSubset(arr);
        //背包三
//        int[] arr={1,4,9};
//        int res=new BackpackIII().backPackII(arr,13);
        //完美平方
//        int res=new PerfectSquares().numSquares(12);
//        System.out.println(res);
        //最大乘积
//        int[] arr={0,0,3,3,0,-2,3,-2,-1,-1,2,1};
//        new MaximumProductSubarray().maxProduct(arr);
        System.out.println(Integer.MAX_VALUE);
    }

}