摘要: 《Exploiting Relevance Feedback in Knowledge Graph》 Publication: KDD 2015 Authors: Yu Su, Shengqi Yang, etc. Affiliation: UCSB... 1. Short description: 阅读全文
posted @ 2017-07-05 13:52 安新 阅读(194) 评论(0) 推荐(0) 编辑
摘要: Given n, how many structurally unique BST's (binary search trees) that store values 1...n? For example,Given n = 3, there are a total of 5 unique BST' 阅读全文
posted @ 2017-07-05 10:39 安新 阅读(130) 评论(0) 推荐(0) 编辑
摘要: In the computer world, use restricted resource you have to generate maximum benefit is what we always want to pursue. For now, suppose you are a domin 阅读全文
posted @ 2017-07-04 13:20 安新 阅读(139) 评论(0) 推荐(0) 编辑
摘要: Given an array of scores that are non-negative integers. Player 1 picks one of the numbers from either end of the array followed by the player 2 and t 阅读全文
posted @ 2017-06-29 14:25 安新 阅读(349) 评论(0) 推荐(0) 编辑
摘要: Given two integers n and k, find how many different arrays consist of numbers from 1 to n such that there are exactly k inverse pairs. We define an in 阅读全文
posted @ 2017-06-26 14:03 安新 阅读(315) 评论(0) 推荐(0) 编辑
摘要: You are given a list of non-negative integers, a1, a2, ..., an, and a target, S. Now you have 2 symbols + and -. For each integer, you should choose o 阅读全文
posted @ 2017-06-25 23:02 安新 阅读(257) 评论(0) 推荐(0) 编辑
摘要: We are playing the Guess Game. The game is as follows: I pick a number from 1 to n. You have to guess which number I picked. Every time you guess wron 阅读全文
posted @ 2017-06-24 13:12 安新 阅读(226) 评论(0) 推荐(0) 编辑
摘要: Given a string of numbers and operators, return all possible results from computing all the different possible ways to group numbers and operators. Th 阅读全文
posted @ 2017-06-21 06:49 安新 阅读(432) 评论(0) 推荐(0) 编辑
摘要: Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element. For exam 阅读全文
posted @ 2017-06-19 13:31 安新 阅读(312) 评论(0) 推荐(0) 编辑
摘要: Given a complete binary tree, count the number of nodes. Definition of a complete binary tree from Wikipedia:In a complete binary tree every level, ex 阅读全文
posted @ 2017-06-19 00:03 安新 阅读(218) 评论(0) 推荐(0) 编辑