页面顶部 Top
文件:  root - text - article - 2019 - 11 - spiral-traversal-of-grid.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 244 次阅读, 14948 次搜索 | 90 个单词

定阅此目录的博客 | 浏览 | 博客存档
Hi, here's your problem today. This problem was recently asked by Amazon:

By the way, check out our NEW project AlgoPro (http://algopro.com) for over 60+ video coding sessions with ex-Google/ex-Facebook engineers.

You are given a 2D array of integers. Print out the clockwise spiral traversal of the matrix.

Example:


grid = [[1, 2, 3, 4, 5],
[6, 7, 8, 9, 10],
[11, 12, 13, 14, 15],
[16, 17, 18, 19, 20]]


The clockwise spiral traversal of this array is:


1, 2, 3, 4, 5, 10, 15, 20, 19, 18, 17, 16, 11, 6, 7, 8, 9, 14, 13, 12


Here is a starting point:


def matrix_spiral_print(M):
# Fill this in.

grid = [[1, 2, 3, 4, 5],
[6, 7, 8, 9, 10],
[11, 12, 13, 14, 15],
[16, 17, 18, 19, 20]]

matrix_spiral_print(grid)
# 1 2 3 4 5 10 15 20 19 18 17 16 11 6 7 8 9 14 13 12
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 244 次阅读, 14948 次搜索 | 90 个单词 定阅此目录的博客

猜您喜欢...

  1. Daily Interview Problem: Given two arrays, write a function to compute their intersection.
  2. Algorithm Interview: Subarray With Target Sum
  3. ImageMagick Vulnerabilities -  CVE-2016–3714
  4. Delphi Dynamic Array
  5. Multitasking
  6. Two-Sum
  7. Compare Version Numbers
  8. Daily Interview Problem: Largest BST in a Binary Tree
  9. Maximum In A Stack
  10. Daily Interview Problem: Get all Values at a Certain Height in a Binary Tree

评论 (0)

    当前页暂时没有评论。


最后更新: October 30 2020 14:21:12 | RSS Subscription
牛排怎么做才好吃? | <meta name="机器人" content="索引, 跟踪">