文件: root - text - article - 2019 - 10 - create-a-simple-calculator.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, | 英文 | 主页 | 类别: 计算机科学 | 567 次阅读, 23690 次搜索 | 61 个单词
| 浏览 | 博客存档
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, | 英文 | 主页 | 类别: 计算机科学 | 567 次阅读, 23690 次搜索 | 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:
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, | 英文 | 主页 | 类别: 计算机科学 | 567 次阅读, 23690 次搜索 | 61 个单词 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: Group Words that are Anagrams
- Daily Interview Problem: Min Stack
- Non-decreasing Array with Single Modification
- Daily Interview Question: Longest Sequence with Two Unique Numbers
- Design Tic-Tac-Toe
- Daily Interview Problem: Full Binary Tree
- [Daily Problem] Angles of a Clock
- [Daily Problem] Longest Increasing Subsequence
- Algorithm Interview Question: Max and Min with Limited Comparisons
- Daily Interview Problem: Look and Say Sequence
©2006~2024 牛排过熟 - 0.0073 秒 - 2651.969 KB/s - 34 在线 内存: 492.7 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)
读写完全 - 一般 - 最小 - 表格 - 所有评论 - 统计
当前页暂时没有评论。