文件: root - text - article - 2019 - 11 - spiral-traversal-of-grid.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 519 次阅读, 20186 次搜索 | 90 个单词
| 浏览 | 博客存档
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 519 次阅读, 20186 次搜索 | 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:
The clockwise spiral traversal of this array is:
Here is a starting point:
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 519 次阅读, 20186 次搜索 | 90 个单词 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
猜您喜欢...
- Algorithm Interview Question: Max and Min with Limited Comparisons
- Daily Interview Question: Find Cycles in a Graph
- [Daily Problem] Witness of The Tall People
- Daily Interview Problem: Min Range Needed to Sort
- Algorithm Interview: Level Order Traversal of Binary Tree
- Daily Interview Problem: Look and Say Sequence
- Daily Interview Problem: Contiguous Subarray with Maximum Sum
- Delphi Dynamic Array
- Algorithm Interview Question: Symmetric k-ary Tree
- Daily Interview Problem: First Missing Positive Integer
©2006~2024 牛排过熟 - 0.0083 秒 - 2499.501 KB/s - 37 在线 内存: 494.99 KB
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - 服务器 PHP 版本号: 7.4.33
牛排怎么做才好吃? | <meta name="机器人" content="索引, 跟踪">
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - 服务器 PHP 版本号: 7.4.33
评论 (0)
读写完全 - 一般 - 最小 - 表格 - 所有评论 - 统计
当前页暂时没有评论。