当前位置:首页 > 通信资讯 > 正文

本文分享了利用二维动态数组指针做矩阵运算的实现代码。

1. 头文件

?
1 2 3 4 5 6 7 8 9 10 11 12 13 14 // juzhen 2.cpp : Defines the entry point for the console application. // #include "stdafx.h" #include "stdlib.h" #include "windows.h" #define OK 0 #define NG -1 typedef struct mat { int nRow; /* 行数 */ int nCol; /* 列数 */ int* pData; /* 指向矩??体的指? */ }MAT;

2. 程序代码

?
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 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 #include "stdafx.h" #include "Matrix_cal.h" /* Entity and initial matrix of the application matrix function */ int MATAlloc(MAT *pMat, int nRow, int nCol) { pMat->pData = (int *) malloc (nRow * nCol * sizeof(int) ); if(NULL == pMat->pData) { printf("Memary is error!\n"); return NG; } for(int i=0; i<nRow; ++i) { for(int j=0; j<nCol; ++j) { *(pMat->pData + i*nCol + j)=0; } } pMat->nRow = nRow; pMat->nCol = nCol; return OK; } /* Release the memory space and reset the matrix data function */ void MATFree(MAT* pMat) { free(pMat->pData); pMat->pData = NULL; pMat->nRow = 0; pMat->nCol = 0; } /* Import of matrix function */ int MATAssign (MAT* pMat1, const MAT* pMat2) { MATAlloc(pMat1, pMat2->nRow, pMat2->nCol); for(int i=0; i < pMat1->nRow; ++i) { for(int j=0; j < pMat1->nCol; ++j) { *(pMat1->pData + i * pMat1->nCol + j) = *(pMat2->pData + i * pMat1->nCol + j); } } return OK; } /* Matrix sum function */ int MATAdd(const MAT* pMat1, const MAT* pMat2, MAT* pMat3) { MATAlloc(pMat3, pMat1->nRow, pMat1->nCol); if((pMat1->nRow == pMat2->nRow) && (pMat1->nCol == pMat2->nCol)) { for(int i=0; i<pMat1->nRow; ++i) { for(int j=0; j<pMat1->nCol; ++j) { *(pMat3->pData + i * pMat3->nCol + j) = *(pMat1->pData + i * pMat1->nCol + j) + *(pMat2->pData + i * pMat1->nCol + j); } } return OK; } else { printf("Not add!\n"); return NG; } } /* Matrix subtraction function */ int MATSub(const MAT* pMat1, const MAT* pMat2, MAT* pMat3) { MATAlloc(pMat3, pMat1->nRow, pMat1->nCol); if((pMat1->nRow == pMat2->nRow) && (pMat1->nCol == pMat2->nCol)) { for(int i=0; i<pMat1->nRow; ++i) { for(int j=0; j<pMat1->nCol; ++j) { *(pMat3->pData + i * pMat3->nCol + j) = *(pMat1->pData + i * pMat1->nCol + j) - *(pMat2->pData + i * pMat1->nCol + j); } } return OK; } else { printf("Not Sub!\n"); return NG; } } /* Matrix clear */ void MATClear(MAT* pMat) { for(int i=0; i<pMat->nRow; ++i) { for(int j=0; j<pMat->nCol; ++j) { *(pMat->pData + i * pMat->nCol + j)=0; } } } /* Matrix multiplication C function */ void MATMulC (MAT* pMat, int C) { for(int i=0; i<pMat->nRow; ++i) { for(int j=0; j<pMat->nCol; ++j) { *(pMat->pData + i * pMat->nCol + j) = C * (*(pMat->pData + i * pMat->nCol + j) ); } } } /* Matrix multiplication function */ int MATMul (const MAT* pMat1, const MAT* pMat2, MAT* pMat3) { MATAlloc(pMat3, pMat1->nRow, pMat2->nCol); if(pMat1->nCol == pMat2->nRow) { for(int i=0; i<pMat1->nRow; ++i) { for(int j=0; j<pMat2->nCol; ++j) { for(int k=0; k<pMat1->nCol; ++k) { *(pMat3->pData + i * pMat2->nCol+j) += *(pMat1->pData + i * pMat2->nRow + k) * (*(pMat2->pData + k * pMat2->nCol + j) ); } } } return OK; } else { printf("not Mul\n"); return NG; } } /* Matrix transpose function */ int MATTransport(const MAT* pMat1, MAT* pMat2) { MATAlloc(pMat2, pMat1->nCol, pMat1->nRow); for(int i=0; i<pMat1->nRow; ++i) { for(int j=0; j<pMat1->nCol; ++j) { *(pMat2->pData + j * pMat1->nRow + i) = *(pMat1->pData + i * pMat1->nCol + j); } } return OK; } /* bool Check_digit(char *kk) { int a = strlen(kk); for(int i = 0; i<a; ++i) { if( ( (int) (*(kk + i) ) > 48) && ( (int) (*(kk + i) ) < 57 || (int) (*(kk + i) ) == 32) ) { return 1; } } return 0; } */ /* Matrix initialization */ void MATinit(MAT *pMat) { bool kos=1; int nRow = 0, nCol = 0; printf("Please input the number of rows: "); scanf_s("%d",&nRow); putchar('\n'); printf("Please input the number of columns: "); scanf_s("%d",&nCol); putchar('\n'); printf("Please input %dX%d Matrix:\n",nRow,nCol); kos=MATAlloc(pMat,nRow,nCol); for(int i=0; i<nRow; ++i) { for(int j=0; j<nCol; ++j) { scanf("%d", pMat->pData + i*nCol + j); } } } /*char arr[100][100]={0}; for(int i=0; i<nRow; ++i) { for(int j=0; j<nCol; ++j) { scanf("%c", &arr[i][j]); kos = Check_digit(&arr[i][j]); } } //ks= atoi(arr[0]); while(kos) { printf(" input is error,Please input again!"); for(int i=0; i<nRow; ++i) { for(int j=0; j<nCol; ++j) { scanf("%c", arr[i]); } } kos = Check_digit(arr[0]); //ks= atoi(arr[0]); } for(int i=0; i<nRow; ++i) { for(int j=0; j<nCol; ++j) { *(pMat->pData + i*nCol + j) = atoi(&arr[i][j]); } } } */ /* Output matrix */ void Print(MAT *pMat) { printf("The result is:\n"); for(int i = 0; i < pMat->nRow; ++i) { for(int j=0; j<pMat->nCol; ++j) { printf("%d ",*( pMat->pData + i * pMat->nCol + j) ); } putchar('\n'); } } int _tmain(int argc, _TCHAR* argv[]) { int nRow = 1,nCol = 1,sign = 1,C = 1,work = 1,sigal=0; MAT Mat, Mat1, Mat2; MAT *pMat = &Mat; MAT *pMat1 = &Mat1; MAT *pMat2 = &Mat2; while(work) { system("cls"); printf(" Welcome To The Matrix Operation system! \n"); printf("------------------------------------------------\n"); printf("1: Open The Generating matrix function!\n"); printf("2: Open The Release matrix function!\n"); printf("3: Open The Import matrix function!\n"); printf("4: Open The Add matrix function!\n"); printf("5: Open The Matrix subtraction function!\n"); printf("6: Open The Clear matrix function!\n"); printf("7: Open The Matrix multiplication C function!\n"); printf("8: Open The Matrix multiplication function!\n"); printf("9: Open The Matrix transpose function!\n"); printf("------------------------------------------------\n"); printf("Please Select operation type:"); scanf("%d",&sign); switch(sign) { case 1: { MATinit(pMat); Print(pMat); } break; case 2: { MATinit(pMat); Print(pMat); MATFree(pMat); } break; case 3: { MATinit(pMat2); MATAssign (pMat1, pMat2); Print(pMat1); } break; case 4: { MATinit(pMat1); MATinit(pMat2); sigal = MATAdd(pMat1, pMat2,pMat); if(0 == sigal) { Print(pMat); } } break; case 5: { MATinit(pMat1); MATinit(pMat2); sigal = MATSub(pMat1, pMat2,pMat); if(0 == sigal) { Print(pMat); } } break; case 6: { MATinit(pMat); Print(pMat); MATClear(pMat); Print(pMat); } break; case 7: { printf("Please input the number of C: "); scanf("%d",&C); putchar('\n'); MATinit(pMat); MATMulC (pMat, C); Print(pMat); } break; case 8: { MATinit(pMat1); MATinit(pMat2); sigal = MATMul (pMat1, pMat2, pMat); if(0 == sigal) { Print(pMat); } } break; case 9: { MATinit(pMat1); MATTransport(pMat1, pMat2); Print(pMat2); } break; default: printf("input is error!"); } printf("Whether exit the Matrix calculation system?(1 is not exit,0 is exit)\n"); //whether exit the system. scanf("%d", &work); fflush(stdin); while (work != 0 && work != 1) //work must is 1 or 0. { printf(" Input is error,Please input again!\n"); scanf("%d", &work); fflush(stdin); } } printf("\n-------------Thanks For You Using The Matrix Calculation System !--------------\n"); Sleep(2000); //deley some times. return 0; }

以上就是实现二维动态数组指针做矩阵运算的代码,希望对大家的学习有所帮助。

如果您对该产品感兴趣,请填写办理(客服微信:xiaoxiongyidong)

为您推荐:

发表评论

◎欢迎参与讨论,请在这里发表您的看法、交流您的观点。