Leetcode演算法教學

[065] LeetCode 128 演算法【Longest Consecutive Sequence】最長連續序列

128. Longest Consecutive Sequence (Hard)

Given an unsorted array of integers, find the length of the longest consecutive elements sequence.

[064] LeetCode 334演算法【Increasing Triplet Subsequence】遞增三元子序列

334. Increasing Triplet Subsequence (Medium)

Given an unsorted array return whether an increasing subsequence of length 3 exists or not in the array.

[063] LeetCode 42 演算法【Trapping Rain Water】收集雨水

42. Trapping Rain Water (Hard)

Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining.

[062] LeetCode 11 演算法【Container With Most Water】盛水最多的容器

[061] LeetCode 309演算法【Best Time to Buy and Sell Stock with Cooldown】 股票機器人擬人版

309. Best Time to Buy and Sell Stock with Cooldown (Medium)

Say you have an array for which the ith element is the price of a given stock on day i.