closestFibonacci

closestFibonacci

1年前 (2018-08-15) 浏览: 7 评论: 0

The Fibonacci sequence of numbers is 1, 1, 2, 3, 5, 8, 13, 21, 34, ... The first and second numbers are 1 and after that ni = ni-2 + ni-1, e.g., 34 = 13 + 21. A number in the sequence is called a Fibo 阅读更多

anagram

anagram

1年前 (2018-08-14) 浏览: 7 评论: 0

One word is an anagram of another word if it is a rearrangement of all the letters of the second word. For example, the character arrays {‘s’, ‘i’, ‘t’} and {‘i’, ‘t’, ‘s’} represent words that are an 阅读更多

hodder number

hodder number

1年前 (2018-08-13) 浏览: 25 评论: 0

A hodder number is one that is prime and is equal to 2j-1 for some j. For example, 31 is a hodder number because 31 is prime and is equal to 25-1 (in this case j = 5). The first 4 hodder numbers are 3 阅读更多

largestDifferenceOfEvens

largestDifferenceOfEvens

1年前 (2018-08-10) 浏览: 8 评论: 0

Write a function named largestDifferenceOfEvens which returns the largest difference between even valued elements of its array argument. For example largestDifferenceOfEvens(new int[ ]{-2, 3, 4, 9}) r 阅读更多

《数字图像处理及模式识别(第二版)沈庭芝》pdf格式下载免费下载电子书

《数字图像处理及模式识别(第二版)沈庭芝》pdf格式下载免费下载电子书

1年前 (2018-08-08) 浏览: 62 评论: 0

《数字图像处理及模式识别(第二版)沈庭芝》pdf格式下载免费下载电子书: https://u253469.ctfile.com/fs/253469-301066195     内容简介 《普通高等教育"十一五"国家规划教材•高等院校电子、信息类教材•数字图像处理及模式识别(第2版)》是高等院校本科生、研究生数字图像处理及模式识别技术的教材。内容包括图像的变换、增强、复原、编码、 阅读更多

SystematicallyIncreasing

SystematicallyIncreasing

1年前 (2018-08-08) 浏览: 13 评论: 0

美国程序员面试题 An array is called systematically increasing if it consists of increasing sequences of the numbers from 1 to n.The first six (there are over 65,000 of them) systematically increasing arrays a 阅读更多

PrimeHappy

PrimeHappy

1年前 (2018-08-06) 浏览: 7 评论: 0

美国程序员面试题 A number n is called prime happy if there is at least one prime less than n and the sum of all primes less than n is evenly divisible by n.Recall that a prime number is an integer > 1 whic 阅读更多

登录

忘记密码 ?

切换登录

注册

扫一扫二维码分享