## java 求一个数字是否包含2

/**    * 求一个数字是否包含2    * …

## An array is defined to be minmax-disjoint if the following conditions hold

1.美国面试题：   An array is defined to be minmax-disjoi…

## Write a function named countRepresentations that returns the number of ways that an amount of money in rupees can be represented as rupee notes.

美国面试题： Write a function named countRepresentatio…

## 递归算法详细讲解欢迎小白C#递归算法

C#递归算法讲解： 什么是递归算法呢： 其实递归算法有2个特点，其中一个就是 ，它会一直不停地调用自己 本身，…

## A perfect number is one that is the sum of its factors, excluding itself. The 1st perfect number is 6 because 6 = 1 + 2 + 3.

A perfect number is one that is the sum of its factors, excluding itself. The 1st perfect number is 6 because 6 = 1 + 2 + 3.

## 数据结构背包问题-简单的背包问题

1. 题目： 有一个背包，能盛放的物品总重量为s，设有n件物品，其重量分别为w1,w2,…,wn.…

## It is a fact that there exist two numbers x and y such that x! + y! = 10!. Write a method named solve10 that returns the values x and y in an array.

It is a fact that there exist two numbers x and y such that x! + y! = 10!. Write a method named solve10 that returns the values x and y in an array.
The notation n! is called n factorial and is equal to n * n-1 * n-2 * … 2 * 1, e.g., 5! = 5*4*3*2*1 = 120.