Beserious - 博客园

2017年10月3日

摘要： Given a binary tree, find the length of the longest path where each node in the path has the same value. This path may or may not pass through the roo 阅读全文

posted @ 2017-10-03 21:29 Beserious 阅读(842) 评论(0) 推荐(0)

leetcode 686. Repeated String Match

摘要： Given two strings A and B, find the minimum number of times A has to be repeated such that B is a substring of it. If no such solution, return 1. For 阅读全文

posted @ 2017-10-03 17:39 Beserious 阅读(372) 评论(0) 推荐(0)

2017年9月25日

leetcode 507. Perfect Number

摘要： We define the Perfect Number is a positive integer that is equal to the sum of all its positive divisors except itself. Now, given an integer n, write 阅读全文

posted @ 2017-09-25 11:36 Beserious 阅读(124) 评论(0) 推荐(0)

2017年9月24日

leetcode 681. Next Closest Time

摘要： Given a time represented in the format "HH:MM", form the next closest time by reusing the current digits. There is no limit on how many times a digit 阅读全文

posted @ 2017-09-24 23:46 Beserious 阅读(1198) 评论(0) 推荐(0)

leetcode 682. Baseball Game

摘要： You're now a baseball game point recorder. Given a list of strings, each string can be one of the 4 following types: Integer (one round's score): Dire 阅读全文

posted @ 2017-09-24 23:44 Beserious 阅读(221) 评论(0) 推荐(0)

leetcode 684. Redundant Connection

摘要： We are given a "tree" in the form of a 2D array, with distinct values for each node. In the given 2D array, each element pair [u, v] represents that v 阅读全文

posted @ 2017-09-24 23:43 Beserious 阅读(408) 评论(0) 推荐(0)

leetcode 677. Map Sum Pairs

摘要： Implement a MapSum class with insert, and sum methods. For the method insert, you'll be given a pair of (string, integer). The string represents the k 阅读全文

posted @ 2017-09-24 00:31 Beserious 阅读(234) 评论(0) 推荐(0)

leetcode 402. Remove K Digits

摘要： 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-09-24 00:13 Beserious 阅读(99) 评论(0) 推荐(0)

2017年9月19日

python numpy

摘要： python keepdims = True和 keepdims = False的区别，设置为True就是保持原来的列矩阵，否则就变成一位数组切片和np.arange()的区别阅读全文

posted @ 2017-09-19 20:05 Beserious 阅读(138) 评论(0) 推荐(0)

2017年9月14日

leetcode 409. Longest Palindrome

摘要： Given a string which consists of lowercase or uppercase letters, find the length of the longest palindromes that can be built with those letters. This 阅读全文

posted @ 2017-09-14 12:29 Beserious 阅读(114) 评论(0) 推荐(0)