Special Pythagorean triplet

这个比较简单，慢慢进入状态。 A Pythagorean triplet is a set of three natural numbers, a b c, for which, a2 + b2 = c2 For example, 32 + 42 = 9 + 16 = 25 = 52.

这个比较简单，慢慢进入状态。

A Pythagorean triplet is a set of three natural numbers, a b c, for which,

a2 + b2 = c2

For example, 32 + 42 = 9 + 16 = 25 = 52.

There exists exactly one Pythagorean triplet for which a + b + c = 1000.
Find the product abc.

for a in xrange(1,1000):

 for b in xrange(1,1000):

 c = 1000 - (a + b)

 if (c * c) == (a * a + b * b):

 print a * b * c

 break

31875000
31875000
请按任意键继续. . .

LeetCode 334. Increasing Triplet Subsequence 给定一个未排序的数组，判断这个数组中是否存在长度为 3 的递增子序列。 数学表达式如下: 如果存在这样的 i, j, k, 且满足 0 i j k n-1， 使得 arr[i] arr[j] arr[k] ，返回 true ; 否则返回 false 。