tangdh03 / easyleetcode Goto Github PK

public class IntegerArrayTest {
    //1-D int array pass
    //1-D String array pass

    @Input(value = "[[4.3,5.31],[6.2,7.3],[8.1,9.2]]",container = "array",type = "float")
    @Input(value = "[[[12,31,32],[12,32,32]],[[12,31,32],[12,32,32]]]",container = "array",type = "int")
    @Solution
    public void IntegerarrayTest(float[][] nums,int[][][] numm)
    {
        System.out.println("I'm in");
    }

    public static void main(String[] args){
        easyLeetcode.Run(IntegerArrayTest.class);
    }

}

public class listTest {
    @Solution
    @Input(value = "[1,2,3]",container = "list",type = "int")
    public void list(List<Integer> l){
        System.out.println(l.toString());
    }

    public static void main(String[] args) {
        easyLeetcode.Run(listTest.class);
    }
}

    @Solution
    @Input(value = "[1.1,2.2,null,4.3,5.1]",container = "tree",type = "double")
    public void tree(DoubleTreeNode node){
        System.out.println(node.val);
    }

    public static void main(String[] args) {
        easyLeetcode.Run(TreeTest.class);
    }

public class LinkdedListTest {
    //linked list pass
    @Input(value = "[1.1,2.2,3.3,4.3,5.3]",container = "linkedlist",type = "float")
    @Solution
    public void Test(FloatListNode listNode){
        System.out.println(listNode.val);
    }

    public static void main(String[] args) {
        easyLeetcode.Run(LinkdedListTest.class);
    }
}