页面顶部 Top
文件:  root - text - article - 2019 - 10 - create-a-simple-calculator.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, | 英文 | 主页 | 类别: 计算机科学 | 301 次阅读, 19385 次搜索 | 61 个单词

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

Given a mathematical expression with just single digits, plus signs, negative signs, and brackets, evaluate the expression. Assume the expression is properly formed.

Example:
Input: - ( 3 + ( 2 - 1 ) )
Output: -4
Here's the function signature:


def eval(expression):
# Fill this in.

print eval('- (3 + ( 2 - 1 ) )')
# -4
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, | 英文 | 主页 | 类别: 计算机科学 | 301 次阅读, 19385 次搜索 | 61 个单词 定阅此目录的博客

猜您喜欢...

  1. Algorithm Interview: Maximum Path Sum in Binary Tree
  2. A trick for getting good at coding interviews FASTER
  3. Fix Brackets
  4. New Vulnerabilities (CVE-2016-4581) have been detected in CentOS/RHEL/CloudLinux 7
  5. Number of Ways to Climb Stairs
  6. Algorithm Interview Question: Max and Min with Limited Comparisons
  7. Detect Linked List Cycle
  8. Daily Interview Puzzle: Intersection of Linked Lists
  9. Daily Interview Problem: Deepest Node in a Binary Tree
  10. Plus One

评论 (0)

    当前页暂时没有评论。


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