上一页 1 ··· 4 5 6 7 8 9 10 11 12 ··· 46 下一页
  2018年2月28日
摘要: Given an input string, reverse the string word by word. For example, Given s = "the sky is blue", return "blue is sky the". Update (2015 02 12): For C 阅读全文
posted @ 2018-02-28 14:49 Beserious 阅读(83) 评论(0) 推荐(0) 编辑
摘要: In a given integer array nums, there is always exactly one largest element. Find whether the largest element in the array is at least twice as much as 阅读全文
posted @ 2018-02-28 13:26 Beserious 阅读(108) 评论(0) 推荐(0) 编辑
摘要: Given a string S, check if the letters can be rearranged so that two characters that are adjacent to each other are not the same. If possible, output 阅读全文
posted @ 2018-02-28 13:21 Beserious 阅读(292) 评论(0) 推荐(0) 编辑
  2018年2月25日
摘要: You are playing a simplified Pacman game. You start at the point (0, 0), and your destination is (target[0], target[1]). There are several ghosts on t 阅读全文
posted @ 2018-02-25 19:07 Beserious 阅读(403) 评论(0) 推荐(0) 编辑
摘要: S and T are strings composed of lowercase letters. In S, no letter occurs more than once. S was sorted in some custom order previously. We want to per 阅读全文
posted @ 2018-02-25 19:06 Beserious 阅读(370) 评论(0) 推荐(0) 编辑
摘要: X is a good number if after rotating each digit individually by 180 degrees, we get a valid number that is different from X. A number is valid if each 阅读全文
posted @ 2018-02-25 19:05 Beserious 阅读(503) 评论(0) 推荐(0) 编辑
摘要: We have two types of tiles: a 2x1 domino shape, and an "L" tromino shape. These shapes may be rotated. XX 阅读全文
posted @ 2018-02-25 19:03 Beserious 阅读(809) 评论(0) 推荐(0) 编辑
  2018年2月23日
摘要: Given a string S, we can transform every letter individually to be lowercase or uppercase to create another string. Return a list of all possible stri 阅读全文
posted @ 2018-02-23 15:26 Beserious 阅读(328) 评论(0) 推荐(0) 编辑
摘要: Given a list of strings words representing an English Dictionary, find the longest word in words that can be built one character at a time by other wo 阅读全文
posted @ 2018-02-23 15:01 Beserious 阅读(135) 评论(0) 推荐(0) 编辑
  2018年1月14日
摘要: A string S of lowercase letters is given. We want to partition this string into as many parts as possible so that each letter appears in at most one p 阅读全文
posted @ 2018-01-14 12:00 Beserious 阅读(211) 评论(0) 推荐(0) 编辑
上一页 1 ··· 4 5 6 7 8 9 10 11 12 ··· 46 下一页