James Pan

原题网址：https://leetcode.com/problems/find-peak-element/A peak element is an element that is greater than its neighbors.Given an input array where num[i] ≠ num[i+1], find a peak element and ret

一个长度为n的数组，从中选取k个数字，若定义这k个数字的半径为排序后相邻两个数字之间的最小间隔，则k个数字所能达到的最大半径是多少？如果k = 1，则半径为无穷大。假设k > 0。方法一：深度优先搜索。class SolutionDFS { private int max = 0; public SolutionDFS(int[] nums, int k) { find(n

原题网址：https://leetcode.com/problems/water-and-jug-problem/You are given two jugs with capacities x and y litres. There is an infinite amount of water supply available. You need to determine wheth

原题网址：https://leetcode.com/problems/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 nul

原题网址：https://leetcode.com/problems/wiggle-subsequence/A sequence of numbers is called a wiggle sequence if the differences between successive numbers strictly alternate between positive and nega

原题网址：https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/Say you have an array for which the ith element is the price of a given stock on day i.Design an algorithm to find the m

原题网址：https://leetcode.com/problems/find-k-pairs-with-smallest-sums/You are given two integer arrays nums1 and nums2 sorted in ascending order and an integer k.Define a pair (u,v) which consists

原题网址：https://leetcode.com/problems/can-i-win/In the "100 game," two players take turns adding, to a running total, any integer from 1..10. The player who first causes the running total to reach

原题网址：https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii/Given a non-empty integer array, find the minimum number of moves required to make all array elements equal, where a m