上一页 1 2 3 4 5 6 7 ··· 23 下一页
摘要: Problem : We are given head, the head node of a linked list containing unique integer values. We are also given the list G, a subset of the values in 阅读全文
posted @ 2020-04-20 17:21 littledy 阅读(80) 评论(0) 推荐(0) 编辑
摘要: Problem : A website domain like "discuss.leetcode.com" consists of various subdomains. At the top level, we have "com", at the next level, we have "le 阅读全文
posted @ 2020-04-20 17:10 littledy 阅读(89) 评论(0) 推荐(0) 编辑
摘要: Problem : In a 2 dimensional array grid, each value grid[i][j] represents the height of a building located there. We are allowed to increase the heigh 阅读全文
posted @ 2020-04-20 16:42 littledy 阅读(98) 评论(0) 推荐(0) 编辑
摘要: Problem : We are to write the letters of a given string S, from left to right into lines. Each line has maximum width 100 units, and if writing a lett 阅读全文
posted @ 2020-04-20 16:17 littledy 阅读(84) 评论(0) 推荐(0) 编辑
摘要: Problem : International Morse Code defines a standard encoding where each letter is mapped to a series of dots and dashes, as follows: "a" maps to ". 阅读全文
posted @ 2020-04-20 15:54 littledy 阅读(83) 评论(0) 推荐(0) 编辑
摘要: Problem : Given a string S, we can transform every letter individually to be lowercase or uppercase to create another string. Return a list of all pos 阅读全文
posted @ 2020-04-20 11:42 littledy 阅读(74) 评论(0) 推荐(0) 编辑
摘要: Problem : Given two integers L and R, find the count of numbers in the range [L, R] (inclusive) having a prime number of set bits in their binary repr 阅读全文
posted @ 2020-04-20 11:20 littledy 阅读(100) 评论(0) 推荐(0) 编辑
摘要: Problem : A matrix is Toeplitz if every diagonal from top left to bottom right has the same element. Now given an M x N matrix, return True if and onl 阅读全文
posted @ 2020-04-20 11:16 littledy 阅读(96) 评论(0) 推荐(0) 编辑
摘要: Problem : 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 w 阅读全文
posted @ 2020-04-19 23:41 littledy 阅读(128) 评论(0) 推荐(0) 编辑
摘要: Problem : Given a directed, acyclic graph of N nodes. Find all possible paths from node 0 to node N 1, and return them in any order. The graph is give 阅读全文
posted @ 2020-04-19 22:51 littledy 阅读(75) 评论(0) 推荐(0) 编辑
上一页 1 2 3 4 5 6 7 ··· 23 下一页