LRU Cache Design and implement a data structure for Least Recently Used (LRU) cache. It should support the fol…

  Print a binary tree in an m*n 2D string array following these rules: The row number m should …

题目： Reverse digits of an integer. Example1: x = 123, return 321Example2: x = -123, return -321 思路 题目…

题目： Given a sorted linked list, delete all duplicates such that each element appear only once. For exampl…

  Given a sorted integer array where the range of elements are [0, 99] inclusive, return its missing rang…

  Given a nested list of integers, return the sum of all integers in the list weighted by their depth. Ea…

双队列法 复杂度 时间 O(N) 空间 O(N) 思路 和Implement Queue using Stack类似，我们也可以用两个队列来模拟栈的操作。当push时，我们将数字offer进非空的队列就行了。当pop时，…

题目 运用你所掌握的数据结构，设计和实现一个 LRU (最近最少使用) 缓存机制。它应该支持以下操作： 获取数据 get 和 写入数据 put 。 获取数据 get(key) - 如果密钥 (key) 存在于缓存中，则获…

  Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in&nb…

  Given a string s1, we may represent it as a binary tree by partitioning it to two non-empty substr…

  You are a professional robber planning to rob houses along a street. Each house has a certain amount of…

  Given m arrays, and each array is sorted in ascending order. Now you can pick up two integers…