syf_2016的博客

Given a non-negative integer n, count all numbers with unique digits, x, where 0 ≤ x n.Example:Given n = 2, return 91. (The answer should be the total numbers in the range of 0 ≤ x < 100, excludin

给定两棵非空二叉树s和t，判定t是否为s的一棵子树。

根据给定的二叉树返回根据其建立的字符串，建立原则按照先序序列顺序，有子节点的用括号括起来，叶子节点的括号省略。特别的，若左孩子不存在而有孩子存在，则左孩子的括号不可省略。

将给定的两个二叉树合并，对应节点都存在的话将值相加作为合并后的节点值。

Given m arrays, and each array is sorted in ascending order. Now you can pick up two integers from two different arrays (each array picks one) and calculate the distance. We define the distance between

Given a non-empty binary tree, return the average value of the nodes on each level in the form of an array. 给定一非空二叉树，返回其每层的平均值所构成的数组。

Given a string, your task is to count how many palindromic substrings in this string.The substrings with different start indexes or end indexes are counted as different substrings even they consist

You are given a string, s, and a list of words, words, that are all of the same length. Find all starting indices of substring(s) ins that is a concatenation of each word in words exactly once and

We are playing the Guess Game. The game is as follows:I pick a number from 1 to n. You have to guess which number I picked.Every time you guess wrong, I'll tell you whether the number is higher or

Given a positive integer num, write a function which returns True ifnum is a perfect square else False.Note:Do not use any built-in library function such assqrt.Example 1:Input: 16Returns:

Given an unsorted array of integers, find the length of longest increasing subsequence.For example,Given [10, 9, 2, 5, 3, 7, 101, 18],The longest increasing subsequence is [2, 3, 7, 101], theref

Given a binary tree, return all root-to-leaf paths.For example, given the following binary tree:   1 /   \2     3 \  5All root-to-leaf paths are:["1->2->5", "1->3"]给定二叉树，返回其所有根到叶的路径。

给定两个字符串s1和s2，编写函数判定s2是否是s1的置换字符串。