07 2017 档案

[Leetcode] Binary tree-- 572. Subtree of Another Tree
摘要：Given two non-empty binary trees s and t, check whether tree t has exactly the same structure and node values with a subtree of s. A subtree of s is a 阅读全文
posted @ 2017-07-31 06:14 安新 阅读(172) 评论(0) 推荐(0)
[Leetcode] Binary tree-- 437. Path Sum III
摘要：You are given a binary tree in which each node contains an integer value. Find the number of paths that sum to a given value. The path does not need t 阅读全文
posted @ 2017-07-30 11:26 安新 阅读(248) 评论(0) 推荐(0)
[Leetcode] Binary tree-- 113. Path Sum II
摘要：Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum. For example:Given the below binary tree and sum 阅读全文
posted @ 2017-07-29 21:29 安新 阅读(232) 评论(0) 推荐(0)
[Leetcode] Binary tree--112. Path Sum
摘要：112. Path Sum Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals th 阅读全文
posted @ 2017-07-29 10:04 安新 阅读(131) 评论(0) 推荐(0)
[Leetcode] Binary tree-- 637. Average of Levels in Binary Tree
摘要：Given a non-empty binary tree, return the average value of the nodes on each level in the form of an array. Example 1: # it actually examines the know 阅读全文
posted @ 2017-07-26 14:06 安新 阅读(141) 评论(0) 推荐(0)
[Leetcode] Binary tree -- 501. Find Mode in Binary Search Tree
摘要：Given a binary search tree (BST) with duplicates, find all the mode(s) (the most frequently occurred element) in the given BST. Assume a BST is define 阅读全文
posted @ 2017-07-25 23:13 安新 阅读(169) 评论(0) 推荐(0)
[Leetcode] Binary tree-- 606. Construct String from Binary Tree
摘要：You need to construct a string consists of parenthesis and integers from a binary tree with the preorder traversing way. The null node needs to be rep 阅读全文
posted @ 2017-07-22 10:08 安新 阅读(132) 评论(0) 推荐(0)
[Leetcode] DP-- 516. Longest Palindromic Subsequence
摘要：Given a string s, find the longest palindromic subsequence's length in s. You may assume that the maximum length of s is 1000. Example 1:Input: "bbbab 阅读全文
posted @ 2017-07-19 12:47 安新 阅读(151) 评论(0) 推荐(0)
[Leetcode] DP-- 638. Shopping Offers
摘要：In LeetCode Store, there are some kinds of items to sell. Each item has a price. However, there are some special offers, and a special offer consists 阅读全文
posted @ 2017-07-16 04:32 安新 阅读(709) 评论(0) 推荐(0)
[Leetcode] DP-- 464. Can I Win
摘要：In the "100 game," two players take turns adding, to a running total, any integer from 1..10. The player who first causes the running total to reach o 阅读全文
posted @ 2017-07-13 21:15 安新 阅读(261) 评论(0) 推荐(0)
[Paper Reading]--Fast top-k search in knowledge graphs
摘要：<<Fast top-k search in knowledge graphs>> Publication: ICDE 2016 Authors: Shengqi Yang∗, Fangqiu Han∗, Yinghui Wu†, Xifeng Yan∗ Affiliation: UCSB, WSU 阅读全文
posted @ 2017-07-11 14:09 安新 阅读(327) 评论(0) 推荐(0)
Spark Standalone Mode Configuration
摘要：For currently popular distributed framework Spark, here it shows the intro and steps to configure the spark standalone mode on several machines. It is 阅读全文
posted @ 2017-07-11 13:23 安新 阅读(207) 评论(0) 推荐(0)
[Leetcode] DP-- 467. Unique Substrings in Wraparound String
摘要：Consider the string s to be the infinite wraparound string of "abcdefghijklmnopqrstuvwxyz", so s will look like this: "...zabcdefghijklmnopqrstuvwxyza 阅读全文
posted @ 2017-07-08 23:22 安新 阅读(145) 评论(0) 推荐(0)
[Leetcode] DP-- 95. Unique Binary Search Trees II
摘要：Given an integer n, generate all structurally unique BST's (binary search trees) that store values 1...n. For example,Given n = 3, your program should 阅读全文
posted @ 2017-07-07 13:54 安新 阅读(267) 评论(0) 推荐(0)
[Paper Reading]--Exploiting Relevance Feedback in Knowledge Graph
摘要：《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 安新 阅读(207) 评论(0) 推荐(0)
[Leetcode] DP-- 96. Unique Binary Search Trees
摘要：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 安新 阅读(138) 评论(0) 推荐(0)
[Leetcode] DP-- 474. Ones and Zeroes
摘要：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 安新 阅读(148) 评论(0) 推荐(0)