Fórum ➡ Rotating a Square Matrix One Cell Counter Clockwise ♦, C#

Fórum ➡ Rotating a Square Matrix One Cell Counter Clockwise ♦

Language: Layout:

//Rextester.Program.Main is the entry point for your code. Don't change it.
//Compiler version 4.0.30319.17929 for Microsoft (R) .NET Framework 4.5

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text.RegularExpressions;

// aljodav http://rextester.com/users/376

// in reply to the MSDN thread http://bit.ly/2lRPDjO

namespace Rextester
{
    public class Program
    {
        static void Write(string s,int[,] m){
            Console.WriteLine("\n{0} {1}✖{1}:",s,m.GetLength(0));
            for(int i=0;i<m.GetLength(0);++i){
                for(int j=0;j<m.GetLength(1);++j){
                    Console.Write("{0,4}  ",m[i,j]);
                }
                Console.WriteLine();
            }
        }
        
        public static void Main(string[] args)
        {
            const int k=15;
            int[,] mk=new int[k,k];
            for(int i=0;i<k*k;++i)mk[i/k,i-(i/k)*k]=i+1;
                                       
            int[,] m5={{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}};     //
            int[,] m4={{1,2,3,4},{5,6,7,8},{9,10,11,12},{13,14,15,16}};
            int[,] m3={{1,2,3},{4,5,6},{7,8,9}};
            int[,] m2={{1,2},{3,4}};
            int[,] m1={{1}};
            
            dynamic[] ds={m1 as dynamic,m2 as dynamic,m3 as dynamic,m4 as dynamic,m5 as dynamic,mk as dynamic};    //
            
            for(int i=0;i<ds.Length;++i){
                int[,] m=ds[i] as int[,];
                Write("Original",m);
            
                RotateOneCellCounterClockwise(ref m);
                Write("Rotated",m);
                
                Console.WriteLine("\n{0}",new string('❇',58));
            }
            
            Console.WriteLine("\n\nHello, world!");
        }
        
        static void RotateOneCellCounterClockwise(ref int[,] m){
            int l=m.GetLength(0);
            if(l!=m.GetLength(1))throw new Exception("The matrix is not square");
            int middle=l/2;
            bool odd=(l%2)==1;
            int[,] r=new int[l,l];
            
            for(int i=0;i<l;++i){
                int corner=l-i-1;
                bool firsthalf=odd?i<=middle:i<middle;
                for(int j=0;j<l;++j){
                    int v=m[i,j];
                    
                    if(firsthalf){
                    
                        if(j<i){
                            r[i+1,j]=v;
                        }else if(j==i){
                            if(odd&&j==middle){r[i,j]=v;continue;}
                            r[i+1,j]=v;
                        }else if(j<=corner){
                            r[i,j-1]=v;
                        }else{
                            r[i-1,j]=v;
                        }
                    
                    }else{
                    
                        if(j<corner){
                            r[i+1,j]=v;
                        }else if(j<i){
                            r[i,j+1]=v;
                        }else{
                            r[i-1,j]=v;
                        }
                    
                    }
                }
            }
            
            m=r;
        }
    }
}

Show compiler warnings [ + ] Show input
Compilation time: 0,14 sec, absolute running time: 0,11 sec, cpu time: 0,08 sec, average memory usage: 14 Mb, average nr of threads: 3

Original 1✖1: 1 Rotated 1✖1: 1 ❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇ Original 2✖2: 1 2 3 4 Rotated 2✖2: 2 4 1 3 ❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇ Original 3✖3: 1 2 3 4 5 6 7 8 9 Rotated 3✖3: 2 3 6 1 5 9 4 7 8 ❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇ Original 4✖4: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 Rotated 4✖4: 2 3 4 8 1 7 11 12 5 6 10 16 9 13 14 15 ❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇ Original 5✖5: 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 Rotated 5✖5: 2 3 4 5 10 1 8 9 14 15 6 7 13 19 20 11 12 17 18 25 16 21 22 23 24 ❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇ Original 15✖15: 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 Rotated 15✖15: 2 3 4 5 6 7 8 9 10 11 12 13 14 15 30 1 18 19 20 21 22 23 24 25 26 27 28 29 44 45 16 17 34 35 36 37 38 39 40 41 42 43 58 59 60 31 32 33 50 51 52 53 54 55 56 57 72 73 74 75 46 47 48 49 66 67 68 69 70 71 86 87 88 89 90 61 62 63 64 65 82 83 84 85 100 101 102 103 104 105 76 77 78 79 80 81 98 99 114 115 116 117 118 119 120 91 92 93 94 95 96 97 113 129 130 131 132 133 134 135 106 107 108 109 110 111 112 127 128 145 146 147 148 149 150 121 122 123 124 125 126 141 142 143 144 161 162 163 164 165 136 137 138 139 140 155 156 157 158 159 160 177 178 179 180 151 152 153 154 169 170 171 172 173 174 175 176 193 194 195 166 167 168 183 184 185 186 187 188 189 190 191 192 209 210 181 182 197 198 199 200 201 202 203 204 205 206 207 208 225 196 211 212 213 214 215 216 217 218 219 220 221 222 223 224 ❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇❇ Hello, world!