动态申请二维数组

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
#include<stdio.h>
#include<stdlib.h>
#include<iostream>

typedef struct Lnode{
	int data;
Lnode *next;

}Lnode,*LinkList;

int main() {
	int** p = (int**)malloc(8 * sizeof(int*));
	for (int i = 0; i < 8; i++) {
		p[i] = (int*)malloc(8 * sizeof(int));
	}

	for(int i = 0;i<8;i++)
		for (int j = 0; j < 8; j++) {
			p[i][j] = rand() % 100;
		}
	for (int i = 0; i < 8; i++) {
		for (int j = 0; j < 8; j++) {
			std::cout << p[i][j] << " ";
		}
		std::cout << std::endl;
	}
		

	for (int i = 0; i < 8; i++) {
		free(p[i]);
	}
	free(p);
	return 0;
}