2015年1月13日
[Leetcode][JAVA] Interleaving String
摘要： Givens1,s2,s3, find whethers3is formed by the interleaving ofs1ands2.For example,Given:s1="aabcc",s2="dbbca",Whens3="aadbbcbcac", return true.Whens3="... 阅读全文
posted @ 2015-01-13 05:22 metalx 阅读(191) 评论(0) 推荐(0)
[Leetcode][JAVA] Recover Binary Search Tree (Morris Inorder Traversal)
摘要： Two elements of a binary search tree (BST) are swapped by mistake.Recover the tree without changing its structure.Note:A solution using O(n) space is ... 阅读全文
posted @ 2015-01-13 03:58 metalx 阅读(279) 评论(0) 推荐(0)