- 博客(4)
- 收藏
- 关注
RSS订阅原创 [Leetcode]94. Binary Tree Inorder Traversal
Given a binary tree, return the inorder traversal of its nodes' values.For example:Given binary tree [1,null,2,3], 1 \ 2 / 3return [1,3,2].Note: Recursive solu
2016-08-21 21:02:27
458
原创 [Leetcode]103. Binary Tree Zigzag Level Order Traversal
Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to right, then right to left for the next level and alternate between).For example:Given binary
2016-08-16 21:57:09
443
原创 [Leetcode]10. Regular Expression Matching
Implement regular expression matching with support for '.' and '*'.'.' Matches any single character.'*' Matches zero or more of the preceding element.The matching should cover the entire input st
2016-08-15 21:56:36
669
原创 [Leetcode]151. Reverse Words in a String
Given an input string, reverse the string word by word.For example,Given s = "the sky is blue",return "blue is sky the".class Solution {public: void reverseWords(string &s) {
2016-08-13 11:37:41
363
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人