2019年7月8日
【leetcode】1111. Maximum Nesting Depth of Two Valid Parentheses Strings
摘要： 题目如下： A string is a valid parentheses string (denoted VPS) if and only if it consists of "(" and ")" characters only, and: It is the empty string, or 阅读全文
posted @ 2019-07-08 15:57 seyjs 阅读(584) 评论(0) 推荐(0) 编辑
【leetcode】1110. Delete Nodes And Return Forest
摘要： 题目如下： Given the root of a binary tree, each node in the tree has a distinct value. After deleting all nodes with a value in to_delete, we are left wit 阅读全文
posted @ 2019-07-08 15:46 seyjs 阅读(750) 评论(0) 推荐(0) 编辑
【leetcode】1108. Defanging an IP Address
摘要： 题目如下： Given a valid (IPv4) IP address, return a defanged version of that IP address. A defanged IP address replaces every period "."with "[.]". Exampl 阅读全文
posted @ 2019-07-08 15:38 seyjs 阅读(1022) 评论(0) 推荐(0) 编辑