LeetCode 39. Combination Sum && 40. Combination Sum II && 216. Combination Sum III

39. Combination SumGiven a set of candidate numbers (C) (without duplicates) and a target number (T), find all unique combinations in C where the can...

LeetCode 35. Search Insert Position

Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in o...

LeetCode 34. Search for a Range

Given an array of integers sorted in ascending order, find the starting and ending position of a given target value.Your algorithm’s runtime complexi...

LeetCode 33. Search in Rotated Sorted Array && 81. Search in Rotated Sorted Array II

###LeetCode 33. Search in Rotated Sorted Array Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.(i.e., ...

LeetCode 31. Next Permutation

Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.If such arrangement is not possib...

LeetCode 27. Remove Element

Given an array and a value, remove all instances of that value in-place and return the new length. Do not allocate extra space for another array, y...

LeetCode 26. Remove Duplicates from Sorted Array && 80. Remove Duplicates from Sorted Array II

LeetCode 26. Remove Duplicates from Sorted ArrayGiven a sorted array, remove the duplicates in place such that each element appear only once and retu...

LeetCode 11. Container With Most Water

Given n non-negative integers a1, a2, …, an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoi...

LeetCode 1. Two Sum

Given an array of integers, return indices of the two numbers such that they add up to a specific target.You may assume that each input would have ex...

LeetCode 328. Odd Even Linked List

Given a singly linked list, group all odd nodes together followed by the even nodes. Please note here we are talking about the node number and not th...

LeetCode 143. Reorder List

Given a singly linked list L: L0→L1→…→Ln-1→Ln, reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→…You must do this in-place without altering the nodes’ values.Fo...

LeetCode 138. Copy 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...

LeetCode 86. Partition List

LeetCode 86. Partition List

LeetCode 82. Remove Duplicates from Sorted List II

LeetCode 82. Remove Duplicates from Sorted List II

LeetCode 83. Remove Duplicates from Sorted List

LeetCode 83. Remove Duplicates from Sorted List

LeetCode 61. Rotate List

LeetCode 61. Rotate List

LeetCode 24.Swap Nodes in Pairs

LeetCode 24.Swap Nodes in Pairs

LeetCode 21.Merge Two Sorted Lists

LeetCode 21.Merge Two Sorted Lists

个人资料
等级：
访问量： 5929
积分： 301
排名： 25万+
文章存档