Cycle1413的博客

368. Largest Divisible SubsetDifficulty: Medium Given a set of distinct positive integers, find the largest subset such that every pair (Si, Sj) of elements in this subset satisfies: Si % Sj = 0 or Sj

374. Guess Number Higher or LowerDifficulty: Easy We are playing the Guess Game. The game is as follows: I pick a number from 1 to n. You have to guess which number I picked. Every time you guess wr

209. Minimum Size Subarray SumDifficulty: Medium Given an array of n positive integers and a positive integer s, find the minimal length of a subarray of which the sum ≥ s. If there isn’t one, return

239. Sliding Window MaximumDifficulty: Hard 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 the k numbers i

330. Patching ArrayDifficulty: Hard Given a sorted positive integer array nums and an integer n, add/patch elements to the array such that any number in range [1, n] inclusive can be formed by the sum

214. Shortest PalindromeDifficulty: Hard Given a string S, you are allowed to convert it to a palindrome by adding characters in front of it. Find and return the shortest palindrome you can find by pe

142. Linked List Cycle IIDifficulty: Medium Given a linked list, return the node where the cycle begins. If there is no cycle, return null.Note: Do not modify the linked list.Follow up: Can you solve

141. Linked List CycleDifficulty: Easy Given a linked list, determine if it has a cycle in it.Follow up: Can you solve it without using extra space?思路定义两个指针，同时从链表头结点出发，一个指针一次走一步，另一个指针一次走两步。如果快的指针追上了慢

092. Reverse Linked List IIDifficulty: Medium Reverse a linked list from position m to n. Do it in-place and in one-pass.For example: Given 1->2->3->4->5->NULL, m = 2 and n = 4,return 1->4->3->2->5->

206. Reverse Linked ListDifficulty: Easy Reverse a singly linked list.思路为了反转链表，需要改变链表中指针的方向，使next指向前面一个结点。 每次调整一个结点，已调整的结点的下一结点为前面的结点。 假设需要调整结点i，调整结束后，i的next要指向它前面的结点h，且链表会在i和最初next指向的结点j之间断裂，为了防止无法

264. Ugly Number IIDifficulty: Medium Write a program to find the n-th ugly number.Ugly numbers are positive numbers whose prime factors only include 2, 3, 5. For example, 1, 2, 3, 4, 5, 6, 8, 9, 10,

263. Ugly NumberDifficulty: Easy Write a program to check whether a given number is an ugly number.Ugly numbers are positive numbers whose prime factors only include 2, 3, 5. For example, 6, 8 are ugl

275. H-Index IIDifficulty: Medium Follow up for H-Index: What if the citations array is sorted in ascending order? Could you optimize your algorithm?Hint: Expected runtime complexity is in O(log n) a

274. H-IndexDifficulty: Medium Given an array of citations (each citation is a non-negative integer) of a researcher, write a function to compute the researcher’s h-index. According to the definition

318. Maximum Product of Word LengthsDifficulty: Medium Given a string array words, find the maximum value of length(word[i]) * length(word[j]) where the two words do not share common letters.You may a

316. Remove Duplicate LettersDifficulty: Hard Given a string which contains only lowercase letters, remove duplicate letters so that every letter appear once and only once. You must make sure your re

268. Missing NumberDifficulty: Medium Given an array containing n distinct numbers taken from 0, 1, 2, …, n, find the one that is missing from the array. For example, Given nums = [0, 1, 3] return 2

228. Summary RangesDifficulty: Medium Given a sorted integer array without duplicates, return the summary of its ranges. For example, given [0,1,2,4,5,7], return [“0->2”,”4->5”,”7”].思路由于数组元素已排好序，而且没有

091. Decode WaysDifficulty: Medium A message containing letters from A-Z is being encoded to numbers using the following mapping: ‘A’ -> 1 ‘B’ -> 2 … ‘Z’ -> 26 Given an encoded message containing

329. Longest Increasing Path in a MatrixDifficulty: Hard Given an integer matrix, find the length of the longest increasing path. From each cell, you can either move to four directions: left, right,