2019年5月10日

205. Isomorphic Strings(字符串同构)

摘要: 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 @ 2019-05-10 23:56 shaer 阅读(106) 评论(0) 推荐(0) 编辑

409. Longest Palindrome(计算一组字符集合可以组成的回文字符串的最大长度)

摘要: Given a string which consists of lowercase or uppercase letters, find the length of the longest palindromes that can be built with those letters. This 阅读全文

posted @ 2019-05-10 22:40 shaer 阅读(187) 评论(0) 推荐(0) 编辑

242. Valid Anagram(两个字符串包含的字符是否完全相同)

摘要: Given two strings s and t , write a function to determine if t is an anagram of s. Example 1: Example 2: Note:You may assume the string contains only 阅读全文

posted @ 2019-05-10 21:47 shaer 阅读(178) 评论(0) 推荐(0) 编辑

导航