三角形数阵

package inspur;

public class noname {
	public static void sanjiao(int start,int end,int column){
		int temp=column;
		int[][] number=new int[column][column];
		for(int j=0;j<column;j++){
			for(int i=0;i<temp;i++){
			if(start%end!=0){
				int x=start%end;
				number[j][i]=x;
			}
			else {
				number[j][i]=end;
			}
			start=start+1;
		}
			temp-=1;
		}
		int count1=column;
		for(int j=0;j<column;j++){
		for(int i=0;i<count1;i++){
			
			System.out.print(number[i][j]+"\t");
			
		}
		count1-=1;
		System.out.println();
		}
		
	}
	public static void main(String[] args){
		noname.sanjiao(3, 5, 8);
	}
}