首页 > 其他 > 详细

leetcode566

时间:2017-05-09 12:25:24      阅读:254      评论:0      收藏:0      [点我收藏+]
public class Solution {
    public int[,] MatrixReshape(int[,] nums, int r, int c) {
        var row = nums.GetLength(0);
            var col = nums.GetLength(1);

            if (row * col != r * c)
            {
                return nums;
            }
            else
            {
                var ary = new int[r, c];
                var list = new List<int>();

                for (int i = 0; i < row; i++)
                {
                    for (int j = 0; j < col; j++)
                    {
                        list.Add(nums[i, j]);
                    }
                }

                var k = 0;
                for (int i = 0; i < r; i++)
                {
                    for (int j = 0; j < c; j++)
                    {
                        ary[i, j] = list[k++];
                    }
                }

                return ary;
            }
    }
}

https://leetcode.com/problems/reshape-the-matrix/#/description

leetcode566

原文:http://www.cnblogs.com/asenyang/p/6829962.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!