Canonzki的博客

leetcode原地址：https://leetcode.com/problems/distinct-subsequences/ 原题： Given a string S and a string T, count the number of distinct subsequences of T in S. A subsequence of a string is a new s

leetcode原地址： https://leetcode.com/problems/valid-number/ 原题： Validate if a given string is numeric. Some examples: "0" => true " 0.1 " => true "abc" => false "1 a" => false "2e10" =>