#include #include // https://www.codewars.com/kata/521c2db8ddc89b9b7a0000c1/ // // Return array elements arranged from outermost elements to the middle element, traveling clockwise, e.g. // // array = [[1,2,3], // [4,5,6], // [7,8,9]] // // #=> [1,2,3,6,9,8,7,4,5] void editXY(int& row, int& col, int& mode, std::vector> visited) { switch (mode) { case 0: col++; if (col >= visited[row].size() || visited[row][col]) { col--; row++; mode = 1; } break; case 1: row++; if (row >= visited.size() || visited[row][col]) { row--; col--; mode = 2; } break; case 2: col--; if (col < 0 || visited[row][col]) { col++; row--; mode = 3; } break; case 3: row--; if (row < 0 || visited[row][col]) { row++; col++; mode = 0; } break; } } std::vector snail(std::vector> array) { // No thanks, segfault. if (!array[0].size()) return {}; bool done = 0; std::vector res; int row = 0, col = 0, mode = 0; std::vector> visited; for (auto i : array) { std::vector temp; for (int j : i) temp.push_back(0); visited.push_back(temp); } while (!done) { res.push_back(array[row][col]); visited[row][col] = done = 1; editXY(row, col, mode, visited); for (auto i : visited) for (auto j : i) done &= j; } return res; } int main() { for (int i : snail({{1,2,3},{4,5,6},{7,8,9}})) std::cout << i << " "; }

Kata Challenge (Snail)