数组:元素对应的地址 相邻且连续的地址
链表:前一个元素指定下一个元素的地址,地址不一定按序排序
int[] a = new int[10] { 11, 12, 13, 14, 15, 16, 17, 18, 19, 20 };
int[] b = new int[10] { 1, 2, 3, 4, 5, 6, 7, 8, 9, 0 };
int i = a[4];
int i2 = b[4];
移除
for (int in2 = 5; in2 < 9; ++in2)
{
a[in2] = a[in2 + 1];
}
export1(a);
替换
int temp = 100;
for (int in3 = 9; in3 > 4; --in3)
{
b[in3] = b[in3 - 1];
}
b[4] = temp;
export1(b);
int[,] in4 = new int[4, 3] //2维数据
{
{5,8,6,},
{7,5,3,},
{8,4,3 },
{10,15,17}
};
int in5 = in4[1, 2];
for (int i1 = 0; i1 < 3; i1++)
{
for (int j = 0; j < 4; j++)
{
// Console.WriteLine(in4[j, i1]);
}
}
int[,,] three = new int[4, 3, 2] //3维数组
{
{ {7 ,4 }, {8 ,8 }, {8 ,6 } },
{ {8 ,6 }, {8 ,5 }, {2 ,3 } },
{ {4 ,1 }, {5 ,3 }, {8 ,1 } },
{ {1 ,0 }, {2 ,5 }, {4 ,1 } }
};
for (int y = 0; y < 4; ++y)
{
for (int j = 0; j < 3; ++j)
{
for (int x = 0; x < 2; ++x)
{
Console.Write(" {0}",three[y,j,x]);
}
}
}
int[][] anomaly = new int[5][] //不规则数组
{
new int[1] {1},
new int[2] {1,2},
new int[4] {1,2,3,4},
new int[2] {1,5},
new int[1] {1},
};
exp(anomaly, 0);
}
static void export1(int[] bb)
{
foreach (int ii in bb)
{
Console.WriteLine(ii);
}
}
static void exp(int[][] x,int index) //递归输出
{
int [] h = x[index];
foreach (int y in h)
{
Console.WriteLine(" {0}",y);
}
++index;
if (index < 5)
exp(x, index);
}
数组
最新推荐文章于 2020-12-10 19:14:11 发布