Raft 算法实现

import java.util.*;

// Raft 节点状态
enum NodeState {
    FOLLOWER,
    CANDIDATE,
    LEADER
}

// Raft 日志条目
class LogEntry {
    int term;
    String command;
}

// Raft 节点
class Node {
    int id;
    NodeState state;
    int currentTerm;
    int votedFor;
    List<LogEntry> log;
    int commitIndex;
    int lastApplied;
    int[] nextIndex;
    int[] matchIndex;

    public Node(int id) {
        this.id = id;
        this.state = NodeState.FOLLOWER;
        this.currentTerm = 0;
        this.votedFor = -1;
        this.log = new ArrayList<>();
        this.commitIndex = 0;
        this.lastApplied = 0;
        this.nextIndex = new int[N];
        this.matchIndex = new int[N];
    }

    // 处理来自其他节点的请求投票请求
    public void handleRequestVote(int candidateId, int term) {
        if (term < currentTerm) {
            // 拒绝投票
            return;
        }

        if (votedFor == -1 || votedFor =