woodyiiiiiii

Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and put. get(key…

Given an array nums, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only se…

动态规划算法(Dynamic Programming)是一门非常热门的解决复杂问题的递归算法，一直是面试算法的热点，本文整理并归纳了一些DP思路技巧和对应的LeetCode题目，方便刷题和复习理解。 动态规划是用来求解把多阶段过程问题求解转化为一系列单阶段问题的，它用于求解以阶…