摘要:
题目:https://leetcode.com/problems/valid-palindrome/description/ Given a string, determine if it is a palindrome, considering only alphanumeric characte 阅读全文
摘要:
题目链接: https://leetcode.com/problems/binary-tree-maximum-path-sum/description/ Given a non-empty binary tree, find the maximum path sum. For this probl 阅读全文
摘要:
题目链接: https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/description/ Say you have an array for which the ith element is the price of a 阅读全文
摘要:
题目:https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/description/ Say you have an array for which the ith element is the price of a giv 阅读全文
摘要:
Say you have an array for which the ith element is the price of a given stock on day i. If you were only permitted to complete at most one transaction 阅读全文
摘要:
Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below. For example, given the fo 阅读全文
摘要:
Given a non-negative index k where k ≤ 33, return the kth index row of the Pascal's triangle. Note that the row index starts from 0. In Pascal's trian 阅读全文
摘要:
Given a non-negative integer numRows, generate the first numRows of Pascal's triangle. In Pascal's triangle, each number is the sum of the two numbers 阅读全文
摘要:
前言:目前自己在做使用Lucene.net和PanGu分词实现全文检索的工作,不过自己是把别人做好的项目进行迁移。因为项目整体要迁移到ASP.NET Core 2.0版本,而Lucene使用的版本是3.6.0 ,PanGu分词也是对应Lucene3.6.0版本的。不过好在Lucene.net 已经有 阅读全文
摘要:
Populate each next pointer to point to its next right node. If there is no next right node, the next pointer should be set to NULL. Initially, all nex 阅读全文