Bresenham算法生成直线

public static void main(String[] args) {
//起点(x0,y0)  终点(x1,y1)
int m = 4;//x1 - x0
int n = 3;//y1 - y0
int x[] = new int[m+1];//x坐标数组
int y[] = new int[m+1];//y坐标数组
int e[] = new int[m+1];//e数组
x[0] = 1;//x[0]赋值x0
y[0] = 0;//x[0]赋值y0
e[0] = 2;//e[0]=2n-m
for (int i = 0; i < m; i++) {
x[i+1] = x[i] + 1;//x方向每次增加1
if (e[i] >= 0) {//若当前e的值大于0
y[i+1] = y[i] + 1;//y方向增加1
e[i+1] = e[i] - 2;//下次e的值 ：e[i+1]=e[i]+2n-2m
}else {//当前e的值小于0
y[i+1] = y[i];//y方向增加1值不变
e[i+1] = e[i] + 6;//下次e的值 ：e[i+1]=e[i]+2n
}
}
System.out.print("x：" + "   ");
for (int i = 0; i < m+1; i++) {//遍历x数组值
System.out.print(x[i] +"  ");
}
System.out.println();
System.out.print("y：" + "   ");
for (int i = 0; i < m+1; i++) {//遍历y数组值
System.out.print(y[i] +"  ");
}
System.out.println();
System.out.print("e：" + "   ");
for (int i = 0; i < m+1; i++) {//遍历e数组值
System.out.print(e[i] +"  ");
}
}