freeCodeCamp/curriculum/challenges/chinese/08-coding-interview-prep/rosetta-code/taxicab-numbers.chinese.md

3.2 KiB
Raw Blame History

title id challengeType videoUrl localeTitle
Taxicab numbers 594ecc0d9a8cf816e3340187 5 出租车号码

Description

出租车编号 此处使用的定义是一个正整数可以用多种方式表示为两个正立方体的总和。第一个出租车编号是17291 3 + 12 3和9 3 + 10 3 。出租车号码也被称为:*出租车号码*出租车号码*出租车号码* Hardy-Ramanujan号码任务编写一个返回最低N个出租车号码的函数。对于每个出租车编号显示数字以及它的构成立方体。另请参阅在线整数序列百科全书上的[http://oeis.org/A001235 A001235出租车编号]。 MathWorld上的Hardy-Ramanujan数字 。 MathWorld上的出租车编号 。维基百科上的出租车号码

Instructions

Tests

tests:
  - text: <code>taxicabNumbers</code>是一个功能。
    testString: 'assert(typeof taxicabNumbers === "function", "<code>taxicabNumbers </code> is a function.");'
  - text: <code>taxicabNumbers</code>应该返回一个数组。
    testString: 'assert(typeof taxicabNumbers(2) === "object", "<code>taxicabNumbers </code> should return an array.");'
  - text: <code>taxicabNumbers</code>应返回一组数字。
    testString: 'assert(typeof taxicabNumbers(100)[0] === "number", "<code>taxicabNumbers </code> should return an array of numbers.");'
  - text: '<code>taxicabNumbers(4)</code>必须返回[1729,4104,13832,20683]。'
    testString: 'assert.deepEqual(taxicabNumbers(4), res4, "<code>taxicabNumbers(4) </code> must return [1729, 4104, 13832, 20683].");'
  - text: 'taxicabNumbers25应该返回[1729,4104,13832,20683,32832,39312,40033,46683,64232,65728,110656,110808,134379,149389,165464,171288,195841,216027,216125,262656,314696,320264 327763,373464,402597]'
    testString: 'assert.deepEqual(taxicabNumbers(25), res25, "taxicabNumbers(25) should return [1729, 4104, 13832, 20683, 32832, 39312, 40033, 46683, 64232, 65728, 110656, 110808, 134379, 149389, 165464, 171288, 195841, 216027, 216125, 262656, 314496, 320264, 327763, 373464, 402597]");'
  - text: 'taxicabNumbers39由20  -  29得到的数字应为[314496,320264,327763,373464,402597,439101,443889,513000,513856]。'
    testString: 'assert.deepEqual(taxicabNumbers(39).slice(20, 29), res39From20To29, "taxicabNumbers(39) resulting numbers from 20 - 29 should be [314496,320264,327763,373464,402597,439101,443889,513000,513856].");'

Challenge Seed

function taxicabNumbers (n) {
  // Good luck!
  return true;
}

After Test

console.info('after the test');

Solution

// solution required