摘要：
Given two strings s and t, determine if they are isomorphic. Two strings are isomorphic if the characters in s can be replaced to get t. All occurrenc 阅读全文
摘要：
跳跃游戏 给出一个非负整数数组，你最初定位在数组的第一个位置。 数组中的每个元素代表你在那个位置可以跳跃的最大长度。 判断你是否能到达数组的最后一个位置。 样例 A = [2,3,1,1,4]，返回 true. A = [3,2,1,0,4]，返回 false. 解题 更新 public class 阅读全文
摘要：
Diophantine reciprocals IIIn the following equation x, y, and n are positive integers.For n = 4 there are exactly three distinct solutions:It can be v... 阅读全文
摘要：
DartsIn the game of darts a player throws three darts at a target board which is split into twenty equal sized sections numbered one to twenty.The sco... 阅读全文
摘要：
Diophantine reciprocals IIn the following equation x, y, and n are positive integers.For n = 4 there are exactly three distinct solutions:What is the ... 阅读全文
摘要：
Minimal networkThe following undirected network consists of seven vertices and twelve edges with a total weight of 243.The same network can be represe... 阅读全文
摘要：
Special subset sums: meta-testingLet S(A) represent the sum of elements in set A of sizen. We shall call it a special sum set if for any two non-empty... 阅读全文
摘要：
Special subset sums: testingLet S(A) represent the sum of elements in set A of sizen. We shall call it a special sum set if for any two non-empty disj... 阅读全文
摘要：
Pandigital Fibonacci endsThe Fibonacci sequence is defined by the recurrence relation:F[n] = F[n-1] + F[n-2], where F[1] = 1 and F[2] = 1.It turns out... 阅读全文
摘要：
Special subset sums: optimumLet S(A) represent the sum of elements in set A of size n. We shall call it a special sum set if for any two non-empty dis... 阅读全文
摘要：
Triangle containmentThree distinct points are plotted at random on a Cartesian plane, for which -1000 ≤ x, y ≤ 1000, such that a triangle is formed.Co... 阅读全文
摘要：
Optimum polynomialIf we are presented with the first k terms of a sequence it is impossible to say with certainty the value of the next term, as there... 阅读全文
