aixh

LeetCode

Java(117) Linux(1) MongoDB(1) MySQL(2) 计算机安全与网络编程(1)

/ 注册

全部文章 / LeetCode （共33篇）

162. Find Peak Element

A peak element is an element that is greater than its neighbors. Given an input array nums, where nums[i] ≠ nums[i+1], find a peak element and return...

LeetCode

2019-04-28

0 498

148. Sort List

Sort a linked list in O(n log n) time using constant space complexity. Example 1: Input: 4->2->1->3 Output: 1->2->3->4 Example 2: ...

LeetCode

2019-04-28

0 440

140. Word Break II

Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, add spaces in s to construct a sentence where each word is ...

LeetCode

2019-04-27

0 389

139. Word Break

Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, determine if s can be segmented into a space-separated sequ...

LeetCode

2019-04-27

0 544

134. Gas Station

There are N gas stations along a circular route, where the amount of gas at station i is gas[i]. You have a car with an unlimited gas tank and it cos...

2019-04-24

0 437

133. Clone Graph

Given a reference of a node in a connected undirected graph, return a deep copy (clone) of the graph. Each node in the graph contains a val (int) and ...

LeetCode

2019-04-24

0 434

132. Palindrome Partitioning II

Given a string s, partition s such that every substring of the partition is a palindrome. Return the minimum cuts needed for a palindrome partitionin...

LeetCode

2019-04-24

0 385

131. Palindrome Partitioning

Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitioning of s. Example:...

LeetCode

2019-04-24

0 540

126. Word Ladder II

Given two words (beginWord and endWord), and a dictionary's word list, find all shortest transformation sequence(s) from beginWord to endWord, such th...

LeetCode

2019-04-24

0 474

76. Minimum Window Substring

Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n). Example: Input: S = &qu...

LeetCode

2019-04-23

0 535