页面顶部 Top
文件:  root - text - article - 2020 - 02 - staying-on-a-chess-board.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 393 次阅读, 23504 次搜索 | 94 个单词

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

A chess board is an 8x8 grid. Given a knight at any position (x, y) and a number of moves k, we want to figure out after k random moves by a knight, the probability that the knight will still be on the chessboard. Once the knight leaves the board it cannot move again and will be considered off the board.

Here's some starter code:

def is_knight_on_board(x, y, k, cache={}):
# Fill this in.

print is_knight_on_board(0, 0, 1)
# 0.25
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 393 次阅读, 23504 次搜索 | 94 个单词 定阅此目录的博客

猜您喜欢...

  1. Spreadsheet Columns
  2. Batch Programming in XP
  3. Floor and Ceiling of a Binary Search Tree
  4. [Daily Problem] Witness of The Tall People
  5. Sort a Partially Sorted List
  6. Daily Interview Problem: Get all Values at a Certain Height in a Binary Tree
  7. CVE-2015-8874 - cPanel EasyApache Vulnerabilities
  8. Daily Interview Problem: Largest Product of 3 Elements I
  9. Algorithm Interview: Permutations of numbers
  10. How to Play WAV music under DOS?

评论 (0)

    当前页暂时没有评论。


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