A-Little-Nut

2018年12月6日

摘要： Given a string, your task is to count how many palindromic substrings in this string. The substrings with different start indexes or end indexes are c 阅读全文

posted @ 2018-12-06 22:08 A-Little-Nut 阅读(148) 评论(0) 推荐(0)

LeetCode 646. Maximum Length of Pair Chain

摘要： You are given n pairs of numbers. In every pair, the first number is always smaller than the second number. Now, we define a pair (c, d) can follow an 阅读全文

posted @ 2018-12-06 22:07 A-Little-Nut 阅读(106) 评论(0) 推荐(0)

LeetCode 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 @ 2018-12-06 22:05 A-Little-Nut 阅读(169) 评论(0) 推荐(0)

LeetCode 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: Note: The range of node’s value 阅读全文

posted @ 2018-12-06 22:04 A-Little-Nut 阅读(141) 评论(0) 推荐(0)

LeetCode 628. Maximum Product of Three Numbers

摘要： Given an integer array, find three numbers whose product is maximum and output the maximum product. Example 1: Example 2: Note: The length of the give 阅读全文

posted @ 2018-12-06 22:02 A-Little-Nut 阅读(116) 评论(0) 推荐(0)

LeetCode 617. Merge Two Binary Trees

摘要： Given two binary trees and imagine that when you put one of them to cover the other, some nodes of the two trees are overlapped while the others are n 阅读全文

posted @ 2018-12-06 22:01 A-Little-Nut 阅读(91) 评论(0) 推荐(0)

2018年12月5日

LeetCode 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 @ 2018-12-05 22:55 A-Little-Nut 阅读(96) 评论(0) 推荐(0)

LeetCode 599. Minimum Index Sum of Two Lists

摘要： Suppose Andy and Doris want to choose a restaurant for dinner, and they both have a list of favorite restaurants represented by strings. You need to h 阅读全文

posted @ 2018-12-05 22:54 A-Little-Nut 阅读(99) 评论(0) 推荐(0)

LeetCode 598. Range Addition II

摘要： Given an m n matrix M initialized with all 0‘s and several update operations. Operations are represented by a 2D array, and each operation is represen 阅读全文

posted @ 2018-12-05 22:52 A-Little-Nut 阅读(74) 评论(0) 推荐(0)

LeetCode 594. Longest Harmonious Subsequence

摘要： We define a harmonious array is an array where the difference between its maximum value and its minimum value is exactly 1. Now, given an integer arra 阅读全文

posted @ 2018-12-05 22:50 A-Little-Nut 阅读(104) 评论(0) 推荐(0)

公告