Fork me on GitHub
上一页 1 ··· 11 12 13 14 15 16 17 18 19 ··· 37 下一页
摘要: You are given several logs that each log contains a unique id and timestamp. Timestamp is a string that has the following format: Year:Month:Day:Hour: 阅读全文
posted @ 2017-07-02 19:54 hellowOOOrld 阅读(444) 评论(0) 推荐(0)
摘要: Given a non-negative integer c, your task is to decide whether there're two integers a and b such that a2 + b2 = c. Example 1: Example 2: 思路: 类似于二分查找。 阅读全文
posted @ 2017-07-02 12:06 hellowOOOrld 阅读(418) 评论(0) 推荐(0)
摘要: In combinatorial mathematics, a derangement is a permutation of the elements of a set, such that no element appears in its original position. There's 阅读全文
posted @ 2017-07-02 11:45 hellowOOOrld 阅读(726) 评论(0) 推荐(0)
摘要: Given two arrays, write a function to compute their intersection. Example:Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2]. Note: Each element i 阅读全文
posted @ 2017-07-01 22:43 hellowOOOrld 阅读(103) 评论(0) 推荐(0)
摘要: Given a non-negative integer num represented as a string, remove k digits from the number so that the new number is the smallest possible. Note: The l 阅读全文
posted @ 2017-07-01 12:25 hellowOOOrld 阅读(224) 评论(0) 推荐(0)
摘要: 最近做实验,需要一些人体关节点的ground truth,需要自己手动标定,于是尝试使用OpenCV的鼠标键盘回调函数实现。 期间遇到不少问题,记录一下。 首先就是鼠标回调函数注册, 其中onMouse为处理鼠标事件的函数。里面需要用的一个索引selectIndex来标记当前鼠标选择的关节点是哪一个 阅读全文
posted @ 2017-06-30 23:22 hellowOOOrld 阅读(2629) 评论(0) 推荐(1)
摘要: Assume you are an awesome parent and want to give your children some cookies. But, you should give each child at most one cookie. Each child i has a g 阅读全文
posted @ 2017-06-28 17:19 hellowOOOrld 阅读(130) 评论(0) 推荐(0)
摘要: Suppose you have a random list of people standing in a queue. Each person is described by a pair of integers (h, k), where h is the height of the pers 阅读全文
posted @ 2017-06-28 16:08 hellowOOOrld 阅读(151) 评论(0) 推荐(0)
摘要: A sequence of numbers is called a wiggle sequence if the differences between successive numbers strictly alternate between positive and negative. The 阅读全文
posted @ 2017-06-27 17:53 hellowOOOrld 阅读(187) 评论(0) 推荐(0)
摘要: Given a positive integer n, find the least number of perfect square numbers (for example, 1, 4, 9, 16, ...) which sum to n. For example, given n = 12, 阅读全文
posted @ 2017-06-27 14:50 hellowOOOrld 阅读(178) 评论(0) 推荐(0)
上一页 1 ··· 11 12 13 14 15 16 17 18 19 ··· 37 下一页