摘要: 题目如下: Given a string S, count the number of distinct, non-empty subsequences of S . Since the result may be large, return the answer modulo 10^9 + 7. 阅读全文
posted @ 2019-02-21 15:18 seyjs 阅读(468) 评论(0) 推荐(0) 编辑
摘要: 题目如下: In a given grid, each cell can have one of three values: the value 0 representing an empty cell; the value 1 representing a fresh orange; the va 阅读全文
posted @ 2019-02-21 10:11 seyjs 阅读(730) 评论(0) 推荐(0) 编辑
摘要: 题目如下: In a binary tree, the root node is at depth 0, and children of each depth k node are at depth k+1. Two nodes of a binary tree are cousins if the 阅读全文
posted @ 2019-02-21 10:06 seyjs 阅读(690) 评论(0) 推荐(0) 编辑