页面顶部 Top
文件:  root - text - article - 2019 - 12 - minimum-removals-for-valid-parenthesis.txt.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 207 次阅读, 16717 次搜索 | 74 个单词

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

You are given a string of parenthesis. Return the minimum number of parenthesis that would need to be removed in order to make the string valid. "Valid" means that each open parenthesis has a matching closed parenthesis.

Example:

"()())()"

The following input should return 1.

")("

Here's a start:


def count_invalid_parenthesis(string):
# Fill this in.

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

猜您喜欢...

  1. Daily Interview Problem: Buddy Strings
  2. Daily Interview Problem: Decode String
  3. Algorithm Interview Question: Find the Single Element in an Array of Duplicates
  4. Daily Interview Problem: Running Median
  5. Progess made
  6. [Daily Problem] Longest Increasing Subsequence
  7. Daily Interview Problem: Minimum Removals for Valid Parenthesis
  8. Find the non-duplicate number
  9. A trick for getting good at coding interviews FASTER
  10. Algorithm Interview: String Compression

评论 (0)

    当前页暂时没有评论。


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