摘要: Given an array of strings, return all groups of strings that are anagrams. All inputs will be in lower case. What is Anagram?- Two strings are anagram 阅读全文
posted @ 2017-06-06 14:03 Review->Improve 阅读(368) 评论(0) 推荐(0) 编辑
摘要: There is a stone game.At the beginning of the game the player picks n piles of stones in a circle. The goal is to merge the stones in one pile observi 阅读全文
posted @ 2017-06-06 14:01 Review->Improve 阅读(2190) 评论(0) 推荐(0) 编辑
摘要: There is a stone game.At the beginning of the game the player picks n piles of stones in a line. The goal is to merge the stones in one pile observing 阅读全文
posted @ 2017-06-06 09:02 Review->Improve 阅读(1247) 评论(0) 推荐(0) 编辑
摘要: Given an array of n distinct non-empty strings, you need to generate minimal possible abbreviations for every word following rules below. Begin with t 阅读全文
posted @ 2017-06-06 06:21 Review->Improve 阅读(449) 评论(0) 推荐(0) 编辑
摘要: Given a non-empty string word and an abbreviation abbr, return whether the string matches with the given abbreviation. A string such as "word" contain 阅读全文
posted @ 2017-06-06 03:43 Review->Improve 阅读(642) 评论(0) 推荐(0) 编辑
摘要: Given a string s and a non-empty string p, find all the start indices of p's anagrams in s. Strings consists of lowercase English letters only and the 阅读全文
posted @ 2017-06-06 01:50 Review->Improve 阅读(1066) 评论(0) 推荐(0) 编辑
摘要: Write a method anagram(s,t) to decide if two strings are anagrams or not. Write a method anagram(s,t) to decide if two strings are anagrams or not. Wr 阅读全文
posted @ 2017-06-06 00:29 Review->Improve 阅读(218) 评论(0) 推荐(0) 编辑
摘要: Given two strings s and t, determine if they are isomorphic. Two strings are isomorphic if the characters in s can be replaced to get t. All occurrenc 阅读全文
posted @ 2017-06-05 05:35 Review->Improve 阅读(1079) 评论(0) 推荐(0) 编辑
摘要: Give you an integer matrix (with row size n, column size m),find the longest increasing continuous subsequence in this matrix. (The definition of the 阅读全文
posted @ 2017-06-03 09:31 Review->Improve 阅读(319) 评论(0) 推荐(0) 编辑
摘要: Give an integer array,find the longest increasing continuous subsequence in this array. An increasing continuous subsequence: Can be from right to lef 阅读全文
posted @ 2017-06-03 08:08 Review->Improve 阅读(204) 评论(0) 推荐(0) 编辑