杨领well

LeetCode

C++(3) Effective C++ 笔记(4) LeetCode Weekly Contest 92(1) LeetCode Weekly Contest 93(2) linux(2) TCP/IP 协议(3) windows(1) 未归档(33) 杨领well 的 TCP/IP 协议专栏(7) 杨领well的 LeetCode 题解专栏(59) 源码(1) 题解(1)

/ 注册

全部文章 / LeetCode （共151篇）

LeetCode:129. Sum Root to Leaf Numbers

LeetCode:129. Sum Root to Leaf Numbers 题目描述 Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number. A...

2018-04-17

0 390

LeetCode: 128. Longest Consecutive Sequence

LeetCode: 128. Longest Consecutive Sequence 题目描述 Given an unsorted array of integers, find the length of the longest consecutive elements sequence. ...

2018-04-16

0 521

LeetCode: 127. Word Ladder

LeetCode: 127. Word Ladder 题目描述 Given two words (beginWord and endWord), and a dictionary’s word list, find the length of shortest transformation se...

2018-04-12

0 437

LeetCode: 126. Word Ladder II

LeetCode: 126. Word Ladder II 最近工作和毕设压力比较大，刷 LeetCode 有点不在状态，代码可能有点难看。不过，整体的思路应该是没有问题的。题目描述 Given two words (beginWord and endWord), and a d...

leetcode

2018-04-11

0 569

LeetCode: 125. Valid Palindrome

LeetCode: 125. Valid Palindrome 题目描述 Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases. ...

leetcode palindrome

2018-04-08

0 431

LeetCode: 124. Binary Tree Maximum Path Sum

LeetCode: 124. Binary Tree Maximum Path Sum 题目描述 Given a binary tree, find the maximum path sum. For this problem, a path is defined as any sequenc...

Leetcode algorithm

2018-04-07

0 637

LeetCode: 122. Best Time to Buy and Sell Stock II

LeetCode: 122. Best Time to Buy and Sell Stock II 题目描述 Say you have an array for which the ith element is the price of a given stock on day i. Desi...

2018-04-05

0 654

LeetCode: 121. Best Time to Buy and Sell Stock

LeetCode: 121. Best Time to Buy and Sell Stock 题目描述 Say you have an array for which the ith element is the price of a given stock on day i. If you ...

2018-04-05

0 445

LeetCode: 120. Triangle

LeetCode: 120. Triangle 题目描述 Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row b...

2018-04-04

0 426

LeetCode: 119. Pascal's Triangle II

LeetCode: 119. Pascal’s Triangle II 题目描述 Given an index k, return the kth row of the Pascal’s triangle. For example, given k = 3, Return [1,3,3,1]...

2018-04-03

0 526