2017年11月4日
lintcode10- String Permutation II- medium
摘要： Given a string, find all permutations of it without duplicates. Example Given "abb", return ["abb", "bab", "bba"]. Given "aabb", return ["aabb", "abab 阅读全文
posted @ 2017-11-04 08:33 jasminemzy 阅读(263) 评论(0) 推荐(0)
lintcode211- String Permutation- easy
摘要： Given two strings, write a method to decide if one is a permutation of the other. Example abcd is a permutation of bcad, but abbe is not a permutation 阅读全文
posted @ 2017-11-04 08:08 jasminemzy 阅读(222) 评论(0) 推荐(0)
lintcode51- Previous Permutation- medium
摘要： Given a list of integers, which denote a permutation. Find the previous permutation in ascending order. Notice The list may contains duplicate integer 阅读全文
posted @ 2017-11-04 06:42 jasminemzy 阅读(120) 评论(0) 推荐(0)
lintcode52- Next Permutation- medium
摘要： Given a list of integers, which denote a permutation. Find the next permutation in ascending order. Notice The list may contains duplicate integers. E 阅读全文
posted @ 2017-11-04 05:20 jasminemzy 阅读(130) 评论(0) 推荐(0)