当前位置:网站首页>2048项目实现
2048项目实现
2022-07-05 06:18:00 【mentalps】
1 2048
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
namespace _2048
{
public class MatrixOperation
{
// 计算矩阵的平滑性和连接性
public int[] SmoothAndNum(int[,] matrix)
{
int[,] matrixIndex = new int[5, 5];
int num = 0;
int smooth = 0;
for (int i = 0; i < 5; i++)
{
for (int j = 0; j < 5; j++)
{
int[] vs1 = MatrixMove(matrix, i, j, 1, ref matrixIndex);
int[] vs2 = MatrixMove(matrix, i, j, 2, ref matrixIndex);
int[] vs3 = MatrixMove(matrix, i, j, 3, ref matrixIndex);
smooth = smooth - vs1[0] - vs2[0] - vs3[0];
num = num + vs1[1] + vs2[1] + vs3[1];
}
}
return new int[2] {
smooth, num };
}
// 穷举所有可能的填充组合
//public List<List<int>> AllComb(int max,int min,int num)
// {
// List<int> comb = new List<int>();
// return;
// }
public static int[] MatrixMove(int[,] matrix, int x, int y, int z, ref int[,] matrixIndex)
{
int num = 0;
int smooth = 0;
switch (z)
{
case 1:
if (x + 1 <= matrix.GetUpperBound(1))
{
smooth = (int)Math.Abs(Math.Log(matrix[x, y], 2) - Math.Log(matrix[x + 1, y], 2));
if (smooth == 0)
{
if (matrixIndex[x, y] == 0)
{
matrixIndex[x, y] = 1;
num = num + 1;
}
if (matrixIndex[x + 1, y] == 0)
{
matrixIndex[x + 1, y] = 1;
num = num + 1;
}
}
}
else
{
smooth = 0;
}
break;
case 2:
if ((x + 1 <= matrix.GetUpperBound(1)) && (y + 1 <= matrix.GetUpperBound(0)))
{
smooth = (int)Math.Abs(Math.Log(matrix[x, y], 2) - Math.Log(matrix[x + 1, y + 1], 2));
if (smooth == 0)
{
if (matrixIndex[x, y] == 0)
{
matrixIndex[x, y] = 1;
num = num + 1;
}
if (matrixIndex[x + 1, y + 1] == 0)
{
matrixIndex[x + 1, y + 1] = 1;
num = num + 1;
}
}
}
else
{
smooth = 0;
}
break;
case 3:
if (y + 1 <= matrix.GetUpperBound(0))
{
smooth = (int)Math.Abs(Math.Log(matrix[x, y], 2) - Math.Log(matrix[x, y + 1], 2));
if (smooth == 0)
{
if (matrixIndex[x, y] == 0)
{
matrixIndex[x, y] = 1;
num = num + 1;
}
if (matrixIndex[x, y + 1] == 0)
{
matrixIndex[x, y + 1] = 1;
num = num + 1;
}
}
}
else
{
smooth = 0;
}
break;
}
return new int[2] {
smooth, num };
}
public int[,] FillMatrix(int[,] matrix)
{
List<Tuple<int, int>> fillSteps = new List<Tuple<int, int>>();
for (int i = 0; i < 5; i++)
{
for (int j = 0; j < 5; j++)
{
if (matrix[i, j] == 0)
{
Tuple<int, int> pos = new Tuple<int, int>(i, j);
fillSteps.Add(pos);
}
}
}
return matrix;
}
// total:需要填充的个数
public static int [] AllComb(int total,int [] nums,int start, ref List<int []> all_list ,int [] all)
{
if (start < total) {
for (int i = 0; i < nums.Length; i++)
{
all[start] = nums[i];
AllComb(total, nums, start+1,ref all_list,all);
int[] b = new int[total];
Array.Copy(all, b, total);
all_list.Add(b);
}
return all;
}
else
{
return all;
}
}
static void Main(string[] args)
{
int[] nums = {
2, 4, 8 };
int num = 3;
List<int []> all = new List<int []>();
int[] s = new int[num];
AllComb(3, nums, 0,ref all, s);
for(int i=0;i<all.Count;i++)
{
for(int j=0;j<num;j++)
{
Console.WriteLine(all[i][j]);
}
}
}
}
}
边栏推荐
- Regulations for network security events of vocational group in 2022 Guizhou Vocational College skill competition
- 数据可视化图表总结(一)
- Leetcode-9: palindromes
- LeetCode-61
- 求组合数 AcWing 889. 满足条件的01序列
- Leetcode heap correlation
- Basic explanation of typescript
- Introduction to LVS [unfinished (semi-finished products)]
- WordPress switches the page, and the domain name changes back to the IP address
- Chapter 6 relational database theory
猜你喜欢
4. Object mapping Mapster
Error ora-28547 or ora-03135 when Navicat connects to Oracle Database
Navicat連接Oracle數據庫報錯ORA-28547或ORA-03135
栈 AcWing 3302. 表达式求值
SPI 详解
求组合数 AcWing 889. 满足条件的01序列
Open source storage is so popular, why do we insist on self-development?
MatrixDB v4.5.0 重磅发布,全新推出 MARS2 存储引擎!
Leetcode-6111: spiral matrix IV
SQLMAP使用教程(一)
随机推荐
In depth analysis of for (VaR I = 0; I < 5; i++) {settimeout (() => console.log (I), 1000)}
MySQL advanced part 2: storage engine
4. 对象映射 - Mapping.Mapster
MySQL advanced part 1: stored procedures and functions
Real time clock (RTC)
Winter messenger 2
[leetcode] day95 effective Sudoku & matrix zeroing
【Rust 笔记】13-迭代器(下)
New title of module a of "PanYun Cup" secondary vocational network security skills competition
What is socket? Basic introduction to socket
[rust notes] 17 concurrent (Part 2)
LeetCode 1200. Minimum absolute difference
[rust notes] 13 iterator (Part 2)
Series of how MySQL works (VIII) 14 figures explain the atomicity of MySQL transactions and the principle of undo logging
__ builtin_ Popcount() counts the number of 1s, which are commonly used in bit operations
Introduction to LVS [unfinished (semi-finished products)]
开源存储这么香,为何我们还要坚持自研?
容斥原理 AcWing 890. 能被整除的数
C Primer Plus Chapter 15 (bit operation)
Regulations for network security events of vocational group in 2022 Guizhou Vocational College skill competition