dddongdong的专栏

Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree is symmetric: 1 / \ 2 2 / \ / \3 4 4 3But the f

LeetCode 上面的题目。

给定一个字符串，包含大小写英文字母，计算最右一个字的长度。

[LeetCode] Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root).For example:Given binary tree {3

/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Soluti

判断链表是否循环，找出循环点。例子：

给定一个n和k，给出c_{n}^k的所有组合。一下是C++实现。