public void DDA(int x0,int y0,int x1,int y1) {
int m = x1 - x0;
int n = y1 - y0;
double x[] = new double[m+1];
double y[] = new double[m+1];
x[0] = x0;
y[0] = y0;
double k = ((double)(y1-y0))/((double)(x1-x0));//直线斜率
double b = ((double)y0) - ((double)(y1-y0))*x0/((double)(x1-x0));//直线b的值
if(Math.abs(k) <= 1){//k的绝对值<=1
if(x1 > x0){//往x正方向走步
for (int i = 0; i < m; i++) {
x[i+1] = x[i] + 1;//x值每次加一
y[i+1] = y
int m = x1 - x0;
int n = y1 - y0;
double x[] = new double[m+1];
double y[] = new double[m+1];
x[0] = x0;
y[0] = y0;
double k = ((double)(y1-y0))/((double)(x1-x0));//直线斜率
double b = ((double)y0) - ((double)(y1-y0))*x0/((double)(x1-x0));//直线b的值
if(Math.abs(k) <= 1){//k的绝对值<=1
if(x1 > x0){//往x正方向走步
for (int i = 0; i < m; i++) {
x[i+1] = x[i] + 1;//x值每次加一
y[i+1] = y