littledy

2020年4月29日

581. Shortest Unsorted Continuous Subarray

摘要： Problem : Given an integer array, you need to find one continuous subarray that if you only sort this subarray in ascending order, then the whole arra 阅读全文

posted @ 2020-04-29 22:26 littledy 阅读(98) 评论(0) 推荐(0) 编辑

3. Longest Substring Without Repeating Characters

摘要： Problem : Given a string, find the length of the longest substring without repeating characters. Example 1: Example 2: Example 3: 思路： Solution (C++) 阅读全文

posted @ 2020-04-29 21:10 littledy 阅读(90) 评论(0) 推荐(0) 编辑

2020年4月23日

239. Sliding Window Maximum

摘要： Problem : 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 see 阅读全文

posted @ 2020-04-23 13:52 littledy 阅读(72) 评论(0) 推荐(0) 编辑

946. Validate Stack Sequences

摘要： Problem : Given two sequences pushed and popped with distinct values, return true if and only if this could have been the result of a sequence of push 阅读全文

posted @ 2020-04-23 08:58 littledy 阅读(86) 评论(0) 推荐(0) 编辑

2020年4月22日

206. Reverse Linked List

摘要： Problem : Reverse a singly linked list. Example: Follow up: A linked list can be reversed either iteratively or recursively. Could you implement both? 阅读全文

posted @ 2020-04-22 22:59 littledy 阅读(86) 评论(0) 推荐(0) 编辑

1351. Count Negative Numbers in a Sorted Matrix

摘要： Problem : Given a matrix which is sorted in non increasing order both row wise and column wise. Return the number of negative numbers in . Example 1: 阅读全文

posted @ 2020-04-22 13:24 littledy 阅读(171) 评论(0) 推荐(0) 编辑

895. Maximum Frequency Stack

摘要： Problem : Implement FreqStack, a class which simulates the operation of a stack like data structure. FreqStack has two functions: push(int x), which p 阅读全文

posted @ 2020-04-22 00:47 littledy 阅读(95) 评论(0) 推荐(0) 编辑

2020年4月21日

155. Min Stack

摘要： Problem : Design a stack that supports push, pop, top, and retrieving the minimum element in constant time. push(x) Push element x onto stack. pop() R 阅读全文

posted @ 2020-04-21 23:25 littledy 阅读(103) 评论(0) 推荐(0) 编辑

225. Implement Stack using Queues

摘要： Problem : Implement the following operations of a stack using queues. push(x) Push element x onto stack. pop() Removes the element on top of the stack 阅读全文

posted @ 2020-04-21 22:28 littledy 阅读(94) 评论(0) 推荐(0) 编辑

1381. Design a Stack With Increment Operation

摘要： Problem : Design a stack which supports the following operations. Implement the CustomStack class: CustomStack(int maxSize) Initializes the object wit 阅读全文

posted @ 2020-04-21 21:31 littledy 阅读(179) 评论(0) 推荐(0) 编辑

公告