{"request":{"endpoint":"https://exercism.org/api/v2/tracks/rust/exercises/spiral-matrix/community_solutions","query":{},"options":{"initial_data":{"results":[{"uuid":"9b750cf86bac49e0a6426d11639bad7d","snippet":"use std::iter; const VECTORS: [(isize, isize); 4] = [(1, 0), (0, 1), (-1, 0), (0, -1)]; pub fn spiral_matrix(size: usize) -> Vec> { let mut matrix = vec![vec![0; size]; size]; let mut movement = VECTORS.iter().cycle(); let (mut x, mut y, mut n) = (-1, 0, 1..); for (move_x, move_y) in iter::once(size) ","num_views":0,"num_stars":65,"num_comments":7,"representation_num_published_solutions":11,"num_iterations":2,"num_loc":16,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-03-25T18:12:36.000Z","is_out_of_date":false,"language":"rust","author":{"handle":"denenr"},"exercise":{"title":"Σπειροειδής πίνακας","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"Rust","icon_url":"https://assets.exercism.org/tracks/rust.svg","highlightjs_language":"rust"},"links":{"public_url":"https://exercism.org/el/tracks/rust/exercises/spiral-matrix/solutions/denenr","private_iterations_url":"https://exercism.org/el/tracks/rust/exercises/spiral-matrix/iterations"}},{"uuid":"eb501d2a75d742a1b94035b375d80c0a","snippet":"pub fn spiral_matrix(size: u32) -> Vec> { let size = size as usize; let mut matrix = vec![vec![0; size]; size]; if size == 0 { return matrix; } matrix[0][0] = 1; let (mut i, mut j) = (0usize, 0usize); ","num_views":0,"num_stars":2,"num_comments":0,"representation_num_published_solutions":6,"num_iterations":2,"num_loc":34,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-06-24T10:26:58.000Z","is_out_of_date":false,"language":"rust","author":{"handle":"danieljl"},"exercise":{"title":"Σπειροειδής πίνακας","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"Rust","icon_url":"https://assets.exercism.org/tracks/rust.svg","highlightjs_language":"rust"},"links":{"public_url":"https://exercism.org/el/tracks/rust/exercises/spiral-matrix/solutions/danieljl","private_iterations_url":"https://exercism.org/el/tracks/rust/exercises/spiral-matrix/iterations"}},{"uuid":"cf109526ce644a9cba7b52c59507fea4","snippet":"static VECTORS_X: [isize; 4] = [0, 1, 0, -1]; static VECTORS_Y: [isize; 4] = [1, 0, -1, 0]; pub fn spiral_matrix(size: usize) -> Vec> { let mut result: Vec> = vec![vec![0; size]; size]; if size == 0 { return result; } let mut x = 0isize; let mut y = -1isize; ","num_views":0,"num_stars":14,"num_comments":1,"representation_num_published_solutions":5,"num_iterations":2,"num_loc":20,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2018-11-09T13:37:17.000Z","is_out_of_date":false,"language":"rust","author":{"handle":"yawpitch"},"exercise":{"title":"Σπειροειδής πίνακας","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"Rust","icon_url":"https://assets.exercism.org/tracks/rust.svg","highlightjs_language":"rust"},"links":{"public_url":"https://exercism.org/el/tracks/rust/exercises/spiral-matrix/solutions/yawpitch","private_iterations_url":"https://exercism.org/el/tracks/rust/exercises/spiral-matrix/iterations"}},{"uuid":"ea1b8d743a704decaeef6d2dfd2bd1cd","snippet":"pub fn spiral_matrix(size: u32) -> Vec> { let mut matrix = vec![vec![0; size as usize]; size as usize]; let mut x = 0usize; let mut y = 0usize; let mut d = Direction::Right; for i in 1..=size * size { matrix[y][x] = i; next(&matrix, size as usize, &mut x, &mut y, &mut d); } matrix ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":53,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-01-11T18:00:24.000Z","is_out_of_date":false,"language":"rust","author":{"handle":"lwshang"},"exercise":{"title":"Σπειροειδής πίνακας","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"Rust","icon_url":"https://assets.exercism.org/tracks/rust.svg","highlightjs_language":"rust"},"links":{"public_url":"https://exercism.org/el/tracks/rust/exercises/spiral-matrix/solutions/lwshang","private_iterations_url":"https://exercism.org/el/tracks/rust/exercises/spiral-matrix/iterations"}},{"uuid":"266a1eedc61849fb858abc315403d4fb","snippet":"pub fn spiral_matrix(size: u32) -> Vec> { let mut matrix = vec![vec![0; size as usize]; size as usize]; let mut x = 0; let mut y = 0; let mut dx = 0; let mut dy = 1; for i in 1..=size * size { matrix[x as usize][y as usize] = i; if x + dx < 0 || x + dx == size as i32 ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":23,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-11-26T19:31:05.000Z","is_out_of_date":false,"language":"rust","author":{"handle":"donaldww"},"exercise":{"title":"Σπειροειδής πίνακας","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"Rust","icon_url":"https://assets.exercism.org/tracks/rust.svg","highlightjs_language":"rust"},"links":{"public_url":"https://exercism.org/el/tracks/rust/exercises/spiral-matrix/solutions/donaldww","private_iterations_url":"https://exercism.org/el/tracks/rust/exercises/spiral-matrix/iterations"}},{"uuid":"4653970f7b3546918e72128523faea9f","snippet":"use std::iter; const VECTORS: [(isize, isize); 4] = [(1, 0), (0, 1), (-1, 0), (0, -1)]; pub fn spiral_matrix(size: usize) -> Vec> { let mut matrix = vec![vec![0; size]; size]; let mut movement = VECTORS.iter().cycle(); let (mut x, mut y, mut n) = (-1, 0, 1..); for (move_x, move_y) in iter::once(size) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":7,"num_loc":21,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-09-24T23:44:17.000Z","is_out_of_date":false,"language":"rust","author":{"handle":"rlouPB"},"exercise":{"title":"Σπειροειδής πίνακας","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"Rust","icon_url":"https://assets.exercism.org/tracks/rust.svg","highlightjs_language":"rust"},"links":{"public_url":"https://exercism.org/el/tracks/rust/exercises/spiral-matrix/solutions/rlouPB","private_iterations_url":"https://exercism.org/el/tracks/rust/exercises/spiral-matrix/iterations"}},{"uuid":"336957b006d74575a0b5024d52b0e027","snippet":"pub fn spiral_matrix(size: u32) -> Vec> { let mut matrix = vec![vec![0; size as usize]; size as usize]; let mut dir: i8 = 1; let mut pos: (i8, i8) = (0, -1); let mut count = 1; let mut length = size; while count <= size * size { for _ in 0..length { pos = (pos.0, pos.1 + dir); matrix[pos.0 as usize][pos.1 as usize] = count; ","num_views":0,"num_stars":1,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":22,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-10-11T19:10:04.000Z","is_out_of_date":false,"language":"rust","author":{"handle":"yaru22"},"exercise":{"title":"Σπειροειδής πίνακας","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"Rust","icon_url":"https://assets.exercism.org/tracks/rust.svg","highlightjs_language":"rust"},"links":{"public_url":"https://exercism.org/el/tracks/rust/exercises/spiral-matrix/solutions/yaru22","private_iterations_url":"https://exercism.org/el/tracks/rust/exercises/spiral-matrix/iterations"}},{"uuid":"7b41140c5345462bae5a5e007bac3088","snippet":"pub fn spiral_matrix(size: u32) -> Vec> { let mut matrix: Vec> = vec![vec![0; size as usize]; size as usize]; let num_concentric_squares = (size as f64 / 2.0).ceil() as usize; let mut counter: u32 = 1; let mut sidelen = size as usize; for i in 0..num_concentric_squares { for j in 0..sidelen { matrix[i][i + j] = counter; counter += 1; } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":30,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-08-08T09:12:44.000Z","is_out_of_date":false,"language":"rust","author":{"handle":"coolPoint"},"exercise":{"title":"Σπειροειδής πίνακας","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"Rust","icon_url":"https://assets.exercism.org/tracks/rust.svg","highlightjs_language":"rust"},"links":{"public_url":"https://exercism.org/el/tracks/rust/exercises/spiral-matrix/solutions/coolPoint","private_iterations_url":"https://exercism.org/el/tracks/rust/exercises/spiral-matrix/iterations"}},{"uuid":"65eb2082ad91478d9d6809d1aadbfd34","snippet":"fn num(row: u32, col: u32, dim: u32) -> u32 { match (row, col) { (0, _) => col + 1, (x, _) if x == dim - 1 => (dim - col) + 2 * dim - 2, (_, 0) => (dim - row) + 3 * dim - 3, (_, x) if x == dim - 1 => dim + row, (_, _) => 4 * dim - 4 + num(row - 1, col - 1, dim - 2), } } ","num_views":0,"num_stars":1,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":14,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-07-30T08:15:01.000Z","is_out_of_date":false,"language":"rust","author":{"handle":"scheidtb"},"exercise":{"title":"Σπειροειδής πίνακας","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"Rust","icon_url":"https://assets.exercism.org/tracks/rust.svg","highlightjs_language":"rust"},"links":{"public_url":"https://exercism.org/el/tracks/rust/exercises/spiral-matrix/solutions/scheidtb","private_iterations_url":"https://exercism.org/el/tracks/rust/exercises/spiral-matrix/iterations"}},{"uuid":"ef371f866520446e947e73de7bd324da","snippet":"fn spiral(width: u32, height: u32, x: u32, y: u32) -> u32 { if y == 0 { x + 1 } else { width + spiral(height - 1, width, y - 1, width - x - 1) } } pub fn spiral_matrix(size: u32) -> Vec> { (0..size) ","num_views":0,"num_stars":12,"num_comments":2,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":12,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-03-12T14:42:52.000Z","is_out_of_date":false,"language":"rust","author":{"handle":"punkstarman"},"exercise":{"title":"Σπειροειδής πίνακας","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"Rust","icon_url":"https://assets.exercism.org/tracks/rust.svg","highlightjs_language":"rust"},"links":{"public_url":"https://exercism.org/el/tracks/rust/exercises/spiral-matrix/solutions/punkstarman","private_iterations_url":"https://exercism.org/el/tracks/rust/exercises/spiral-matrix/iterations"}},{"uuid":"23bde74a1b7a4727b1b689ea70da017f","snippet":"pub fn spiral_matrix(size: u32) -> Vec> { let mut result: Vec> = Vec::new(); for i in 0..size { let mut row: Vec = Vec::new(); for j in 0..size { let x = i.min(j).min((size - 1 - i).min(size - 1 - j)); if i <= j { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":20,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-09-29T15:43:17.000Z","is_out_of_date":false,"language":"rust","author":{"handle":"Axyswert"},"exercise":{"title":"Σπειροειδής πίνακας","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"Rust","icon_url":"https://assets.exercism.org/tracks/rust.svg","highlightjs_language":"rust"},"links":{"public_url":"https://exercism.org/el/tracks/rust/exercises/spiral-matrix/solutions/Axyswert","private_iterations_url":"https://exercism.org/el/tracks/rust/exercises/spiral-matrix/iterations"}},{"uuid":"51e2847426ba46b69c01609f08ccff90","snippet":"pub fn spiral_matrix(size: u32) -> Vec> { let solve = |i, j| -> u32 { use std::cmp::min; let outside_squares = min(min(size - 1 - i, i), min(size - 1 - j, j)); dbg!(outside_squares); let cur_size = size - 2 * outside_squares; (1..) .take(outside_squares as usize) .map(|k| 4 * (size + 1 - 2 * k as u32)) .sum::() ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":24,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-09-26T07:03:51.000Z","is_out_of_date":false,"language":"rust","author":{"handle":"huyk18"},"exercise":{"title":"Σπειροειδής πίνακας","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"Rust","icon_url":"https://assets.exercism.org/tracks/rust.svg","highlightjs_language":"rust"},"links":{"public_url":"https://exercism.org/el/tracks/rust/exercises/spiral-matrix/solutions/huyk18","private_iterations_url":"https://exercism.org/el/tracks/rust/exercises/spiral-matrix/iterations"}},{"uuid":"eea1f93d5f0d42a8aa5f728dd37e4639","snippet":"pub fn spiral_matrix(size: u32) -> Vec> { let mut matrix: Vec> = vec![vec![0; size as usize]; size as usize]; (1..=size*size).fold(((0, 0), (1, 0)), |(xy, d), n| { let (x, y) = (xy.0 as usize, xy.1 as usize); matrix[y][x] = n; let new_d = match d { (1, 0) if x == size as usize - 1 || matrix[y][x + 1] != 0 => (0, 1), (0, 1) if y == size as usize - 1 || matrix[y + 1][x] != 0 => (-1, 0), (-1, 0) if x == 0 || matrix[y][x - 1] != 0 => (0, -1), (0, -1) if y == 0 || matrix[y - 1][x] != 0 => (1, 0), ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":20,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-06-26T18:42:03.000Z","is_out_of_date":false,"language":"rust","author":{"handle":"mattnewport"},"exercise":{"title":"Σπειροειδής πίνακας","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"Rust","icon_url":"https://assets.exercism.org/tracks/rust.svg","highlightjs_language":"rust"},"links":{"public_url":"https://exercism.org/el/tracks/rust/exercises/spiral-matrix/solutions/mattnewport","private_iterations_url":"https://exercism.org/el/tracks/rust/exercises/spiral-matrix/iterations"}},{"uuid":"c5b4079a0a514b378c121bffbffba3ec","snippet":"use std::iter::{repeat_with, repeat}; pub fn spiral_matrix(size: u32) -> Vec> { if size == 0 { return Vec::new(); } let mut end = repeat_with(|| vec![1; size as usize]) .take(size as usize).collect::>(); let mut instructions = (1 ..).flat_map(|x| [x, x]) .zip({ let mut dirs = [(1, 2), (0, 1), (1, 0), (2, 1)]; dirs.rotate_right(2 * (size as usize % 2)); dirs.into_iter().cycle() ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":3,"num_loc":29,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-06-08T13:46:02.000Z","is_out_of_date":false,"language":"rust","author":{"handle":"apleeagain"},"exercise":{"title":"Σπειροειδής πίνακας","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"Rust","icon_url":"https://assets.exercism.org/tracks/rust.svg","highlightjs_language":"rust"},"links":{"public_url":"https://exercism.org/el/tracks/rust/exercises/spiral-matrix/solutions/apleeagain","private_iterations_url":"https://exercism.org/el/tracks/rust/exercises/spiral-matrix/iterations"}},{"uuid":"9ed89c9ec743468abfb1927cb4ee296d","snippet":"pub fn spiral_matrix(size: u32) -> Vec> { let size = size as usize; let mut result = vec![vec![0_u32; size]; size]; let mut count = 1; for layer in 0..(size + 1) / 2 { for ptr in layer..(size - layer) { result[layer][ptr] = count; count += 1; } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":28,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-09-02T07:42:27.000Z","is_out_of_date":false,"language":"rust","author":{"handle":"EAS-Exercism"},"exercise":{"title":"Σπειροειδής πίνακας","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"Rust","icon_url":"https://assets.exercism.org/tracks/rust.svg","highlightjs_language":"rust"},"links":{"public_url":"https://exercism.org/el/tracks/rust/exercises/spiral-matrix/solutions/EAS-Exercism","private_iterations_url":"https://exercism.org/el/tracks/rust/exercises/spiral-matrix/iterations"}},{"uuid":"f702d3903d16447788686b9cbb209f68","snippet":"pub fn spiral_matrix(size: u32) -> Vec> { let mut matrix = vec![]; for _ in 0..size { matrix.push(vec![0; size as usize]); } let nums = size.pow(2); let mut x: i32 = 0; let mut y: i32 = 0; let mut d = 0; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":29,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-03-30T19:29:43.000Z","is_out_of_date":false,"language":"rust","author":{"handle":"kfedorov91"},"exercise":{"title":"Σπειροειδής πίνακας","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"Rust","icon_url":"https://assets.exercism.org/tracks/rust.svg","highlightjs_language":"rust"},"links":{"public_url":"https://exercism.org/el/tracks/rust/exercises/spiral-matrix/solutions/kfedorov91","private_iterations_url":"https://exercism.org/el/tracks/rust/exercises/spiral-matrix/iterations"}},{"uuid":"3f8affdf66bd4dd38849bf86296c043c","snippet":"const BASIS: [(isize, isize); 4] = [(1, 0), (0, 1), (-1, 0), (0, -1)]; pub fn spiral_matrix(size: isize) -> Vec> { let mut spiral = vec![vec![0; size as usize]; size as usize]; let mut directions = BASIS.iter().cycle(); let mut n = 1..; let (mut x, mut y) = (-1, 0); ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":3,"num_loc":17,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-12-07T21:51:12.000Z","is_out_of_date":false,"language":"rust","author":{"handle":"letum"},"exercise":{"title":"Σπειροειδής πίνακας","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"Rust","icon_url":"https://assets.exercism.org/tracks/rust.svg","highlightjs_language":"rust"},"links":{"public_url":"https://exercism.org/el/tracks/rust/exercises/spiral-matrix/solutions/letum","private_iterations_url":"https://exercism.org/el/tracks/rust/exercises/spiral-matrix/iterations"}},{"uuid":"fd8cb06edfcc4f72a64371ef1c0327e8","snippet":"use std::iter::{once, repeat}; const DELTAS: [(i32, i32); 4] = [(0, 1), (1, 0), (0, -1), (-1, 0)]; pub fn spiral_matrix(size: u32) -> Vec> { let mut matrix: Vec> = vec![vec![0; size as usize]; size as usize]; let mut deltas = DELTAS.iter().cycle(); let mut pos = (0, -1); for (delta, n) in once(size) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":4,"num_loc":17,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-05-24T12:26:09.000Z","is_out_of_date":false,"language":"rust","author":{"handle":"janmr"},"exercise":{"title":"Σπειροειδής πίνακας","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"Rust","icon_url":"https://assets.exercism.org/tracks/rust.svg","highlightjs_language":"rust"},"links":{"public_url":"https://exercism.org/el/tracks/rust/exercises/spiral-matrix/solutions/janmr","private_iterations_url":"https://exercism.org/el/tracks/rust/exercises/spiral-matrix/iterations"}},{"uuid":"b15ac377115a4130a36897ab19069e2f","snippet":"pub fn spiral_matrix(size: u32) -> Vec> { match size { 0 => vec![], 1 => vec![vec![1]], _ => { let mut numbers = (1..=size * size).rev().collect::>(); let mut top: usize = 0; let mut left: usize = 0; let mut bottom: usize = (size - 1) as usize; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":43,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-08-28T02:12:40.000Z","is_out_of_date":false,"language":"rust","author":{"handle":"crinsilo"},"exercise":{"title":"Σπειροειδής πίνακας","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"Rust","icon_url":"https://assets.exercism.org/tracks/rust.svg","highlightjs_language":"rust"},"links":{"public_url":"https://exercism.org/el/tracks/rust/exercises/spiral-matrix/solutions/crinsilo","private_iterations_url":"https://exercism.org/el/tracks/rust/exercises/spiral-matrix/iterations"}},{"uuid":"3a3e89faaca64db88ac9fb37da0b9f66","snippet":"use std::convert::{TryFrom, TryInto}; enum Direction { Up, Down, Left, Right, } pub fn spiral_matrix(size: u32) -> Vec> { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":55,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-01-05T14:20:41.000Z","is_out_of_date":false,"language":"rust","author":{"handle":"1000teslas"},"exercise":{"title":"Σπειροειδής πίνακας","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"Rust","icon_url":"https://assets.exercism.org/tracks/rust.svg","highlightjs_language":"rust"},"links":{"public_url":"https://exercism.org/el/tracks/rust/exercises/spiral-matrix/solutions/1000teslas","private_iterations_url":"https://exercism.org/el/tracks/rust/exercises/spiral-matrix/iterations"}},{"uuid":"800fb54a0e4c4fefb056d4ac4e5a19ee","snippet":"fn set_matrix_value(matrix: &mut Vec>, row: usize, column: usize, value: &u32) { *matrix.get_mut(row).unwrap().get_mut(column).unwrap() = *value; } pub fn spiral_matrix(size: u32) -> Vec> { let mut value: u32 = 1; let mut size = size as usize; let mut matrix: Vec> = Vec::with_capacity(size); for _ in 0..size { matrix.push(vec![0; size]); ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":37,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-09-18T09:19:42.000Z","is_out_of_date":false,"language":"rust","author":{"handle":"Willson"},"exercise":{"title":"Σπειροειδής πίνακας","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"Rust","icon_url":"https://assets.exercism.org/tracks/rust.svg","highlightjs_language":"rust"},"links":{"public_url":"https://exercism.org/el/tracks/rust/exercises/spiral-matrix/solutions/Willson","private_iterations_url":"https://exercism.org/el/tracks/rust/exercises/spiral-matrix/iterations"}},{"uuid":"0d41533868f94b26be91e5576c6dc830","snippet":"pub fn spiral_matrix(size: u32) -> Vec> { let size = size as usize; let mut matrix = vec![vec![0; size]; size]; if size == 0 { return matrix; } let max_count = (size as u32).pow(2) + 1; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":33,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-01-24T15:44:45.000Z","is_out_of_date":false,"language":"rust","author":{"handle":"paulvt"},"exercise":{"title":"Σπειροειδής πίνακας","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"Rust","icon_url":"https://assets.exercism.org/tracks/rust.svg","highlightjs_language":"rust"},"links":{"public_url":"https://exercism.org/el/tracks/rust/exercises/spiral-matrix/solutions/paulvt","private_iterations_url":"https://exercism.org/el/tracks/rust/exercises/spiral-matrix/iterations"}},{"uuid":"6f3da38949a746a8b6e484974a73d0fc","snippet":"pub fn spiral_matrix(size: u32) -> Vec> { match size { 0 => return Vec::new(), 1 => return vec![vec![1]], _ => (), } let mut v = vec![vec![0; size as usize]; size as usize]; let mut i = (1..=size * size).peekable(); let (mut l, mut r, mut t, mut b) = (0, size as usize - 1, 0, size as usize - 1); while let Some(_) = i.peek() { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":29,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-10-30T21:39:38.000Z","is_out_of_date":false,"language":"rust","author":{"handle":"fawick"},"exercise":{"title":"Σπειροειδής πίνακας","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"Rust","icon_url":"https://assets.exercism.org/tracks/rust.svg","highlightjs_language":"rust"},"links":{"public_url":"https://exercism.org/el/tracks/rust/exercises/spiral-matrix/solutions/fawick","private_iterations_url":"https://exercism.org/el/tracks/rust/exercises/spiral-matrix/iterations"}},{"uuid":"c69bb62685f2425b9e4f7da2a55ec625","snippet":"use std::cmp::min; pub fn spiral_matrix(size: u32) -> Vec> { let mut svec: Vec> = Vec::>::with_capacity(size as usize); let max_value: u32 = size * size + 1; for _ in 0..size { svec.push(Vec::::with_capacity(size as usize)); } for i in 0..size { for j in 0..size { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":25,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-01-25T06:55:14.000Z","is_out_of_date":false,"language":"rust","author":{"handle":"mishan88"},"exercise":{"title":"Σπειροειδής πίνακας","icon_url":"https://assets.exercism.org/exercises/spiral-matrix.svg"},"track":{"title":"Rust","icon_url":"https://assets.exercism.org/tracks/rust.svg","highlightjs_language":"rust"},"links":{"public_url":"https://exercism.org/el/tracks/rust/exercises/spiral-matrix/solutions/mishan88","private_iterations_url":"https://exercism.org/el/tracks/rust/exercises/spiral-matrix/iterations"}}],"meta":{"current_page":1,"total_count":877,"total_pages":37,"unscoped_total":877}}}}}

Γλώσσες προγραμματισμού

Μάθε προγραμματισμό με το Jiki

Το Ταξίδι σου

Τα Αγαπημένα σουΝέο

Προνόμια του Exercism

Βίντεο της Κοινότητας

Σειρά σύντομων εισαγωγών

Συνεντεύξεις και ιστορίες

Discord

Φόρουμ

Ξεκινώντας

Καθοδήγηση

Τεκμηρίωση

Συνεισφέροντες

ΜεταφραστέςΝέο

Κάνε δωρεά

Σχετικά με το Exercism

Ο αντίκτυπός μας

Συγχρονισμός GitHubΝέο

Insiders