2016年3月18日
leetcode:longest-increasing
摘要： 1、 Give an integer array，find the longest increasing continuous subsequence in this array. An increasing continuous subsequence: For [5, 4, 2, 1, 3], 阅读全文
posted @ 2016-03-18 17:10 自朗活 阅读(166) 评论(0) 推荐(0) 编辑
leetcode：length of last world
摘要： 1、 Given a string s consists of upper/lower-case alphabets and empty space characters ' ', return the length of last word in the string. If the last w 阅读全文
posted @ 2016-03-18 16:51 自朗活 阅读(136) 评论(0) 推荐(0) 编辑
leetcode:Inver Binary Tree
摘要： 1、 Invert a binary tree. 阅读全文
posted @ 2016-03-18 16:28 自朗活 阅读(102) 评论(0) 推荐(0) 编辑