2017年11月13日
leetcode — distinct-subsequences
摘要： ``` import java.util.Arrays; / Source : https://oj.leetcode.com/problems/distinct subsequences/ Given a string S and a string T, count the number of d 阅读全文
posted @ 2017-11-13 08:18 lacker 阅读(191) 评论(0) 推荐(0)
leetcode — flatten-binary-tree-to-linked-list
摘要： ``` import java.util.ArrayList; import java.util.Arrays; import java.util.List; /** * Source : https://oj.leetcode.com/problems/flatten-binary-tree-to-linked-list/ * * * Given a binary tree, flat... 阅读全文
posted @ 2017-11-13 08:17 lacker 阅读(135) 评论(0) 推荐(0)