-
Next Greater lexicographical Permutation |字典序
Implement**next permutation**, which rearranges numbers into the lexicographically next greater permutation of numbers.
-
Median of Two Sorted Arrays
Find the median of the two sorted arrays within time O(log(n))
-
LRU Cache
Design and implement a data structure for LRU.
-
Deep Copy Linked List with Random Pointer
A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null. Return a deep copy of the list.
-
Technical Report for CS 6421 Distributed Systems
conclude the topics I've learned about this semester
-
Computer Network Exam2 Review outline
Chapter 4,5,8,9
-
Contains Duplicate | 判断数组中是否有重复元素
Given an array of integers, find if the array contains any duplicates.
-
Remove Duplicates from Sorted Array | O(1)空间内移除数组重复内容
Given a sorted array nums, remove the duplicates in-place such that each element appear only once and return the new length.
-
Move Zeroes | 把0移到数组末尾
Given an array nums, write a function to move all 0's to the end of it while maintaining the relative order of the non-zero elements.
-
Simple Regular Expression Matching
Implement regular expression matching with support for '.' and '*'.
-
Product of Array Except Self
Given an array nums[], return an array such that output[i] is equal to the product of all the elements of nums except nums[i]
-
3 Sum
Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.
-
Linked List Cycle
Given a linked list, determine if it has a cycle in it.
