摘要：
Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level). For example: 问题比较明显，就是按层数从左往右输出每 阅读全文
摘要：
Given a Binary Search Tree (BST), convert it to a Greater Tree such that every key of the original BST is changed to the original key plus sum of all 阅读全文
摘要：
There are N students in a class. Some of them are friends, while some are not. Their friendship is transitive in nature. For example, if A is a direct 阅读全文
摘要：
Problem： Given two strings s1, s2, find the lowest ASCII sum of deleted characters to make two strings equal. Example 1: Example 2: 给定两个字符串s1,s2，删除其中一 阅读全文
摘要：
Problem： A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below). The robot can only move either down or right 阅读全文
摘要：
Problem: Given two non-empty binary trees s and t, check whether tree t has exactly the same structure and node values with a subtree of s. A subtree 阅读全文
摘要：
#include int main() { double data[10]; ifstream in; in.open("data.txt"); for (int i=0; i>data[i]; cout << data[i]<<endl; } in.close(); ofstream out; out.open(... 阅读全文
摘要：
将小波展开系数当成离散信号，尺度函数和小波函数的MRA方程系数看成数字滤波器组，根据Mallat快速算法的原理，小波变换对数据的处理方法可简化成对信号逐级采样和滤波的过程。 图1 小波变换的滤波器实现 (a)分解算法 (b)重构算法 一层小波分解算法流程如图2所示，信号将先经过小波分解低通滤波器和高 阅读全文