Java实现五子棋

代码：

package com.hotusm.datastructure.list;

import com.hotusm.datastructure.Log;

/**
 * @author luqibao
 * @date 2017/3/17
 */
public class Chess {

    public static final int WHITE = ; //白棋
    public static final int BLACK = ; //黑棋

    private int[][] chessboard;
    private int xSize;
    private int ySize;

    public Chess(int size) {
        chessboard = new int[size][size];
        xSize = size;
        ySize = size;
    }

    public Chess() {
        chessboard = new int[][];
        xSize = ;
        ySize = ;
    }

    public void play(int x, int y, int who) {

        if (x > xSize || y > ySize) {
            Log.warn("超出范围!");
            return;
        }
        if (chessboard[x][y] != ) {
            Log.warn("该位置不能下");
            return;
        }
        chessboard[x][y] = who;
        if (isSuccess()) {
            Log.info("who:" + who + "已经获胜");
        }
    }

    public boolean isSuccess() {
        //x轴
        for (int i = ; i < ySize; i++) {
            for (int j = ; j < xSize; j++) {
                if (xSize - j < ) {
                    break;
                }
                if (arriSSame(chessboard[i], j, j + )) {
                    return true;
                }
            }
        }
        //y轴
        for (int i = ; i < xSize; i++) {
            for (int j = ; j < ySize; j++) {
                if (ySize - j < ) {
                    break;
                }
                if (arriSSame(copyY2X(chessboard, i), j, j + )) {
                    return true;
                }
            }
        }
        //交叉
        if (isCrossSame()) {
            return true;
        }
        return false;
    }

    /**
     * 将数组的Y列数据拷贝到一维数组中去
     *
     * @param arr
     * @param y
     * @return
     */
    private int[] copyY2X(int[][] arr, int y) {
        int[] nArr = new int[ySize];
        for (int i = ; i < ySize; i++) {
            nArr[i] = arr[i][y];
        }
        return nArr;
    }

    /**
     * 是否有5个相同
     *
     * @param arr
     * @param x1
     * @param x2
     * @return
     */
    private boolean arriSSame(int[] arr, int x1, int x2) {
        int sameNum = ;
        for (int i = x1; i < x2 - ; i++) {
            if (arr[i] == arr[i + ] && arr[i] != ) {
                sameNum++;
                if (sameNum == ) {
                    return true;
                }
            } else {
                sameNum = ;
            }
        }
        return false;
    }

    /**
     * 交叉情况下是否有5个相同
     *
     * @return
     */
    private boolean isCrossSame() {
        if (cross(ySize, "Y")) {
            return true;
        }
        if (cross(xSize, "X")) {
            return true;
        }
        for (int x = ; x < xSize; x++) {
            int sameNum = ;
            for (int i = x - , j = ; i > ; i--, j++) {
                if (chessboard[j][i] == chessboard[j + ][i - ] && chessboard[j][i] != ) {
                    sameNum++;
                    if (sameNum == ) {
                        return true;
                    }
                } else {
                    sameNum = ;
                }
            }
        }
        for (int y = ySize - ; y > ; y++) {
            int sameNum = ;
            for (int i = y - , j = xSize - ; i < ySize - ; i++, j--) {
                if (chessboard[i][j] == chessboard[i + ][j - ] && chessboard[i][j] != ) {
                    sameNum++;
                    if (sameNum == ) {
                        return true;
                    }
                } else {
                    sameNum = ;
                }
            }
        }

        return false;
    }

    /**
     * @param xSize
     * @param flag  X 或者Y 表示X轴或者是Y轴
     * @return
     */
    private boolean cross(int xSize, String flag) {
        for (int y = xSize - ; y > ; y--) {
            int sameNum = ;
            //y-1 为坐标
            for (int i = y - , j = ; i < xSize - ; i++, j++) {
                if (flag.equals("X")) {
                    if (chessboard[j][i] == chessboard[j + ][i + ] && chessboard[j][i] != ) {
                        sameNum++;
                        if (sameNum == ) {
                            return true;
                        }
                    } else {
                        sameNum = ;
                    }
                } else {
                    if (chessboard[i][j] == chessboard[i + ][j + ] && chessboard[i][j] != ) {
                        sameNum++;
                        if (sameNum == ) {
                            return true;
                        }
                    } else {
                        sameNum = ;
                    }
                }
            }
        }

        return false;
    }
}