上一页 1 ··· 160 161 162 163 164 165 166 167 168 ··· 273 下一页
摘要: On a staircase, the i-th step has some non-negative cost cost[i] assigned (0 indexed). Once you pay the cost, you can either climb one or two steps. Y 阅读全文
posted @ 2018-04-06 21:16 bonelee 阅读(189) 评论(0) 推荐(0)
摘要: Given a string and an integer k, you need to reverse the first k characters for every 2k characters counting from the start of the string. If there ar 阅读全文
posted @ 2018-04-06 20:47 bonelee 阅读(160) 评论(0) 推荐(0)
摘要: Given an integer, return its base 7 string representation. Example 1: Input: 100 Output: "202" Example 2: Input: -7 Output: "-10" Note: The input will 阅读全文
posted @ 2018-04-06 20:18 bonelee 阅读(255) 评论(0) 推荐(0)
摘要: Given two arrays, write a function to compute their intersection. Example: Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2, 2]. Note: Each eleme 阅读全文
posted @ 2018-04-06 18:49 bonelee 阅读(146) 评论(0) 推荐(0)
摘要: Given an array where elements are sorted in ascending order, convert it to a height balanced BST. For this problem, a height-balanced binary tree is d 阅读全文
posted @ 2018-04-06 18:40 bonelee 阅读(236) 评论(0) 推荐(0)
摘要: Given a list of sorted characters letters containing only lowercase letters, and given a target letter target, find the smallest element in the list t 阅读全文
posted @ 2018-04-06 17:28 bonelee 阅读(172) 评论(0) 推荐(0)
摘要: You are given a string representing an attendance record for a student. The record only contains the following three characters: A student could be re 阅读全文
posted @ 2018-04-06 12:54 bonelee 阅读(197) 评论(1) 推荐(0)
摘要: Given an integer array, find three numbers whose product is maximum and output the maximum product. Example 1: Example 2: Note: 这个题目本质上是一个数学题,需要细心观察才可 阅读全文
posted @ 2018-04-06 12:12 bonelee 阅读(171) 评论(2) 推荐(0)
摘要: 结果: [[1, 2], [1, 3], [1, 4], [2, 3], [2, 4], [3, 4]] 本质上是递归降维求解。 组合问题C(n, m)降维为C(n-1,m-1),而第一位可以: 选择1, 不选择1选择2, 不选择1不选择2选择3。。。。 if choose 1: xxx else: 阅读全文
posted @ 2018-04-05 19:07 bonelee 阅读(687) 评论(0) 推荐(0)
摘要: | 类循环排列 # tree DFS def loop_permutation(arr, depth, path, result): if depth == len(arr): result.append(list(path)) return for n in arr: path.append(n) 阅读全文
posted @ 2018-04-05 11:16 bonelee 阅读(787) 评论(0) 推荐(0)
上一页 1 ··· 160 161 162 163 164 165 166 167 168 ··· 273 下一页