矩阵转址的一般算法（OC实现）

来源：互联网发布：unity3d源码及策划书编辑：程序博客网时间：2024/06/04 19:30

（－ω－）

////  main.m//  objective-cTest////  Created by FIREDOM on 3/31/13.//  Copyright (c) 2013 firedom. All rights reserved.//#import <Foundation/Foundation.h>#import "sort.h"int main(int argc, const char * argv[]){    @autoreleasepool    {        firedom *myfiredom;        myfiredom = [firedom alloc];        [myfiredom inputArea];        [myfiredom inputData];        [myfiredom display];    }    return 0;}

////  sort.h//  objective-cTest////  Created by FIREDOM on 3/31/13.//  Copyright (c) 2013 firedom. All rights reserved.//#import <Foundation/Foundation.h>@interface firedom : NSObject-(void)inputArea;-(void)inputData;-(void)display;@end

////  sort.m//  objective-cTest////  Created by FIREDOM on 3/31/13.//  Copyright (c) 2013 firedom. All rights reserved.//#import "sort.h"@implementation firedomconst int N = 30;int a[N][N], b[N][N];int i, j;int length, height;-(void)inputArea{    printf("请输入数组的长宽:\n");    scanf("%d%d", &length, &height);}-(void)inputData{    printf("请输入数组的元素:\n");    for(i = 0; i < length; i++)        for(j = 0; j < height; j++)        {            scanf("%d",&a[i][j]);            b[j][i] = a[i][j];        }    }-(void)display{    printf("原矩阵为:\n");    for(i = 0; i < length; i++)    {        for(j = 0; j < height; j++)        {            printf("%d ",a[i][j]);        }        puts("");    }    printf("转置矩阵为:\n");    for(i = 0; i < height; i++)    {        for(j = 0; j < length; j++)        {            printf("%d ", b[i][j]);        }        puts("");    }}@end