【LeetCode】LeetCodeUtil

public class LeetCodeUtil
{

    public static void printNodeList(ListNode head)
    {
        while (head != null)
        {
            if (head.next != null)
            {
                System.out.print(head + "->");
            }
            else
            {
                System.out.println(head);
            }
            head = head.next;
        }
    }

    public static void printIntArray(int[] nums, int n)
    {
        System.out.print("{ ");
        for (int i = 0; i < n; i++)
        {
            if (i == (n - 1))
            {
                System.out.print(nums[i]);
            }
            else
            {
                System.out.print(nums[i] + ", ");
            }
        }
        System.out.println(" }");
    }

    public static void printIntTwoDimensionalArray(int[][] nums)
    {
        for (int i = 0; i < nums.length; i++)
        {
            if (i == 0)
            {
                System.out.print("{ ");
            }
            for (int j = 0; j < nums[i].length; j++)
            {
                if (j == 0)
                {
                    System.out.print("{ " + nums[i][j] + ", ");
                }
                else if (j != nums[i].length - 1)
                {
                    System.out.print(nums[i][j] + ", ");
                }
                else if (j == nums[i].length - 1)
                {
                    if (i == nums.length - 1)
                    {
                        System.out.print(nums[i][j] + " }");
                    }
                    else
                    {
                        System.out.print(nums[i][j] + " }, ");
                    }

                }
            }
            if (i == nums.length - 1)
            {
                System.out.println(" }");
            }
        }
    }

    public static void swap(int[] A, int i, int j) {
        int tmp = A[i];
        A[i] = A[j];
        A[j] = tmp;
    }

}