James Pan

原题网址：https://leetcode.com/problems/word-break/Given a string s and a dictionary of words dict, determine if s can be segmented into a space-separated sequence of one or more dictionary words.

一个长度为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/unique-binary-search-trees/Given n, how many structurally unique BST's (binary search trees) that store values 1...n?For example,Given n = 3, there are a

原题网址：https://leetcode.com/problems/interleaving-string/Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2.For example,Given:s1 = "aabcc",s2 = "dbbca",When

原题网址：https://leetcode.com/problems/super-pow/Your task is to calculate ab mod 1337 where a is a positive integer and b is an extremely large positive integer given in the form of an array.Exam

原题网址：https://leetcode.com/problems/edit-distance/Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.)Y

原题网址：https://leetcode.com/problems/distinct-subsequences/Given a string S and a string T, count the number of distinct subsequences of T in S.A subsequence of a string is a new string which

原题网址：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