To the Top
File:  root - text - article - 2019 - 11 - spiral-traversal-of-grid.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 251 Views, 15060 Search Bots | 90 Words

Subscribe to Feed Burner | Browse | Archive
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
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 251 Views, 15060 Search Bots | 90 Words Subscribe to Feed Burner

Related Articles

  1. Spectrum Master
  2. Two-Sum
  3. PHP Unit Tests on VPS Server
  4. Invert a Binary Tree
  5. Daily Interview Problem: Largest Product of 3 Elements I
  6. [Daily Problem] Add two numbers as a linked list
  7. Two Tricks of Delphi
  8. Algorithm Interview: Smallest Number that is not a Sum of a Subset of List
  9. Daily Interview Problem: Reconstrunct Binary Tree from Preorder and Inorder Traversals
  10. Daily Interview Problem: Largest BST in a Binary Tree

Comments (0)

    Be the first one to comment this page !


Page Edited: May 11 2024 14:36:49 | RSS Subscription
How to Cook a Perfect Steak? | <meta name="robots" content="noindex, follow" />