创世区块包括时间戳，哈希值，上一个区块哈希值，区块编号，其他区块包括时间戳，哈希值，上一个区块哈希值，交易数据，然后交易数据包括发送者接收者交易金额最后创世区块和区块形成区块链用Java实现

好的，首先我们需要定义一个区块类，包含时间戳、哈希值、上一个区块哈希值、区块编号和交易数据属性。同时，我们需要定义一个交易类，包含发送者、接收者和交易金额属性。以下是一个简单的Java实现：

import java.util.ArrayList;
import java.util.Date;

public class Block {
    private int index;
    private long timestamp;
    private ArrayList<Transaction> transactions;
    private String previousHash;
    private String hash;

    public Block(int index, long timestamp, ArrayList<Transaction> transactions, String previousHash) {
        this.index = index;
        this.timestamp = timestamp;
        this.transactions = transactions;
        this.previousHash = previousHash;
        this.hash = calculateHash();
    }

    public int getIndex() {
        return index;
    }

    public long getTimestamp() {
        return timestamp;
    }

    public ArrayList<Transaction> getTransactions() {
        return transactions;
    }

    public String getPreviousHash() {
        return previousHash;
    }

    public String getHash() {
        return hash;
    }

    public String calculateHash() {
        // 计算当前区块的哈希值
    }
}

public class Transaction {
    private String sender;
    private String receiver;
    private int amount;

    public Transaction(String sender, String receiver, int amount) {
        this.sender = sender;
        this.receiver = receiver;
        this.amount = amount;
    }

    public String getSender() {
        return sender;
    }

    public String getReceiver() {
        return receiver;
    }

    public int getAmount() {
        return amount;
    }
}

接下来，我们需要定义一个区块链类，包括添加区块、验证区块链、获取最后一个区块等方法。以下是一个简单的Java实现：

import java.util.ArrayList;

public class Blockchain {
    private ArrayList<Block> blocks;

    public Blockchain() {
        this.blocks = new ArrayList<>();
        // 创建创世区块
        Block genesisBlock = new Block(0, new Date().getTime(), new ArrayList<>(), "0");
        this.blocks.add(genesisBlock);
    }

    public Block getLatestBlock() {
        return this.blocks.get(this.blocks.size() - 1);
    }

    public void addBlock(Block block) {
        // 设置当前区块的上一个区块哈希值
        block.previousHash = getLatestBlock().getHash();
        // 计算当前区块的哈希值
        block.hash = block.calculateHash();
        // 添加新区块
        this.blocks.add(block);
    }

    public boolean isChainValid() {
        for (int i = 1; i < this.blocks.size(); i++) {
            Block currentBlock = this.blocks.get(i);
            Block previousBlock = this.blocks.get(i - 1);

            // 验证当前区块的哈希值是否正确
            if (!currentBlock.getHash().equals(currentBlock.calculateHash())) {
                return false;
            }

            // 验证当前区块的上一个区块哈希值是否等于前一个区块的哈希值
            if (!currentBlock.getPreviousHash().equals(previousBlock.getHash())) {
                return false;
            }
        }

        return true;
    }
}

以上是一个简单的Java实现，仅供参考。在实际应用中，需要考虑更多的安全性、性能和可扩展性问题。