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

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

Given a file path with folder names, '..' (Parent directory), and '.' (Current directory), return the shortest possible file path (Eliminate all the '..' and '.').

Example
Input: '/Users/Joma/Documents/../Desktop/./../'
Output: '/Users/Joma/'

def shortest_path(file_path):
# Fill this in.

print shortest_path('/Users/Joma/Documents/../Desktop/./../')
# /Users/Joma/
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 695 次阅读, 21444 次搜索 | 78 个单词 定阅此目录的博客

猜您喜欢...

  1. Daily Interview Problem: Spiral Traversal of Grid
  2. Daily Interview Problem: Validate Binary Search Tree
  3. Daily Interview Puzzle: Falling Dominoes
  4. Daily Interview Puzzle: Minimum Size Subarray Sum
  5. Algorithm Interview Question: Nth Fibonacci Number
  6. Spectrum Master
  7. Daily Interview Problem: Reconstrunct Binary Tree from Preorder and Inorder Traversals
  8. Skip the readings, focus on problems. And use all the hints!
  9. A trick for getting good at coding interviews FASTER
  10. Daily Interview Problem: Minimum Removals for Valid Parenthesis

评论 (0)

    当前页暂时没有评论。


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