问题:
段位:4
说明:
对一个输入二维数组,进行蜗牛型的回旋遍历,然后输出遍历后的一维数组。
array = [[1,2,3], [4,5,6], [7,8,9]] 进行回旋遍历之后 array => [1,2,3,6,9,8,7,4,5]
输入范围:
考虑数组为空
输入案例:
// 也就是上图举例
array = [[1,2,3],
[4,5,6],
[7,8,9]]
snail(array) #=> [1,2,3,6,9,8,7,4,5]
我的代码:
比较随性的代码,自由发挥弄出来了跑了2kms
public class SnailSort {
public static void main(String[] args) {
int[][] arr = new int[][]{
{1,2,3}
, {4,5,6}
, {7,8,9}};
int[] res = Snail.snail(arr);
for(int i : res) System.out.print(i + ",");
}
static class Snail {
public static int[] snail(int[][] arra