关于数组的toString的重写问题采用for循环或者是采用封装toString输出数组

package com.javamvc.learning.leetcode;

import java.lang.reflect.Array;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;

 public class LeetCode88MergeSortedArray {

   public static void main(String[] args) {
	

	LeetCode88MergeSortedArray let88 = new LeetCode88MergeSortedArray();
	Solution solution = let88.new Solution();
	
	int []nums1 = {1,2,3,0,0,0};
	int []nums2 = {2,5,6};
	int[] merge = solution.merge(nums1, 3, nums2, 3);
	
	/*
	     * 采用for循环的形式将数组输出
	 */
	for (int i = 0; i < merge.length;i++) {
		System.out.print(merge[i]);
	}
}

class Solution {
    public int[]  merge(int[] nums1, int m, int[] nums2, int n) {
        
            int i = m - 1, j = n - 1, k = m + n - 1;
        while(i >=0 && j >= 0) {
            if(nums1[i] > nums2[j]) nums1[k--] = nums1[i--];
            else nums1[k--] = nums2[j--];
        }
        while(j >= 0) nums1[k--] = nums2[j--];
        /*
         * 
                               * 采用封装好的toString的方法进行输出
         */
        System.out.println(Arrays.toString(nums1)+"\t11111");
        System.out.println(Arrays.toString(nums2)+"\t2");
        System.out.println(nums1+"\t3");
        System.out.println(nums2+"\t4");
		return nums1;
        
		}

	@Override
	public String toString() {
		return "Solution [getClass()=" + getClass() + ", hashCode()=" + hashCode() + ", toString()="
				+ super.toString() + "]";
	}
		
	}
	}