以下是一个简单的 2048 小游戏，使用 Go 编写：
”`go package main
import (
"fmt"
"math/rand"
"time"
)
const (
boardSize = 4
winValue = 2048
)
type direction int
const (
up direction = iota
down
left
right
)
type gameBoard [boardSize][boardSize]int
func (gb *gameBoard) String() string {
var s string
for _, row := range gb {
for _, val := range row {
s += fmt.Sprintf("%4d", val)
}
s += "\n"
}
return s
}
func (gb *gameBoard) addRandomTile() bool {
if gb.isFull() {
return false
}
rand.Seed(time.Now().UnixNano())
for i := 0; i < boardSize*boardSize; i++ {
row, col := rand.Intn(boardSize), rand.Intn(boardSize)
if gb[row][col] == 0 {
gb[row][col] = (rand.Int()%2 + 1) * 2 // either 2 or 4 with equal probability
return true
}
}
panic("unreachable")
}
func (gb *gameBoard) isFull() bool {
for _, row := range gb {
for _, val := range row {
if val == 0 {
return false
}
}
}
return true
}
func (gb *gameBoard) canMove(d direction) bool {
switch d {
case up:
for col := range gb[0] {
for row := boardSize - 1; row > 0; row-- { // start from bottom to avoid redundant checks when shifting tiles up and left.
if gb[row][col] != 0 && (gb[row-1][col] == 0 || gb[row-1][col] == gb[row][col]) {
return true
}
}
}
case down:
for col := range gb[0] {
for row := 0; row < boardSize-1; row++ { // start from top to avoid redundant checks when shifting tiles down and right.
if gb[row][col] != 0 && (gb[row+1][col] == 0 || gb[row+1][col] == gb[row][col]) {
return true
}
}
}
case left:
for row := range gb {
for col := boardSize - 1; col > 0; col-- { // start from right to avoid redundant checks when shifting tiles up and left.
if gb[row][col] != 0 && (gb[row][col-1] == 0 || gb[row][col-1] == gb[row][col]) {
return true
}
}
}
case right:
for row := range gb {
for col := 0; col < boardSize-1; col++ { // start from left to avoid redundant checks when shifting tiles down and right.
if gb[row][col] != 0 && (gb[row][col+1] == 0 || gb[row][col+1] == gb[row][col]) {
return true
}
}
}
default:
panic("invalid direction")
}
return false
}
func (gb *gameBoard) shift(d direction) bool {
var moved bool
switch d {
case up:
for col := range gb[0
![func orangesRotting(grid [][]int) int {
var totalOrigin, curOrigin, totalTime int
queue := make([][2]int, 0)
height := len(grid)
width := len(grid[0])
for i := 0; i < height; i++ {
for j := 0; j < width; j++ {
if grid[i][j] == 1 {
t...](https://linuxcpp.0voice.com/zb_users/upload/2023/05/202305162230045000530.png)
![root@ght:~# journalctl -u lsyncd.service -n 10
-- Logs begin at Mon 2023-08-14 02:38:05 UTC, end at Thu 2024-10-31 01:05:02 UTC. --
Oct 31 00:47:51 ght systemd[1]: lsyncd.service: Succeeded.
Oct 31 00:50:50 ght systemd[1]: Started Lsync Service.
O...](https://linuxcpp.0voice.com/zb_users/upload/2023/05/202305162232428008348.png)
![func orangesRotting(grid [][]int) int {
var totalOrigin, curOrigin, totalTime int
queue := make([][2]int, 0)
height := len(grid)
width := len(grid[0])
for i := 0; i < height; i++ {
for j := 0; j < width; j++ {
...](https://linuxcpp.0voice.com/zb_users/upload/2023/05/202305162215084030351.png)
