Files
freeCodeCamp/curriculum/challenges/chinese/08-coding-interview-prep/rosetta-code/sedols.chinese.md
Kristofer Koishigawa b3213fc892 fix(i18n): chinese test suite (#38220)
* fix: Chinese test suite

Add localeTiltes, descriptions, and adjust test text and testStrings to get the automated test suite working.

* fix: ran script, updated testStrings and solutions
2020-03-03 18:49:47 +05:30

1.7 KiB
Raw Blame History

title, id, challengeType, videoUrl, localeTitle
title id challengeType videoUrl localeTitle
SEDOLs 59d9c6bc214c613ba73ff012 5 SEDOLs

Description

任务:

对于6位SEDOL的每个数字列表,计算并附加校验和数字。

也就是说,给定左侧的输入字符串,您的函数应返回右侧的相应字符串:

 <pre> 710889 => 7108899 B0YBKJ => B0YBKJ7 406566 => 4065663 B0YBLH => B0YBLH2 228276 => 2282765 B0YBKL => B0YBKL9 557910 => 5579107 B0YBKR => B0YBKR5 585284 => 5852842 B0YBKT => B0YBKT7 B00030 => B000300 </pre> 

还要检查每个输入是否正确形成尤其是对于SEDOL字符串中允许的有效字符。您的函数应在无效输入时返回null

Instructions

Tests

tests:
  - text: <code>sedol</code>是一个功能。
    testString: assert(typeof sedol === 'function');
  - text: <code>sedol('a')</code>应该返回null。
    testString: assert(sedol('a') === null);
  - text: <code>sedol('710889')</code>应返回'7108899'。
    testString: assert(sedol('710889') === '7108899');
  - text: <code>sedol('BOATER')</code>应该返回null。
    testString: assert(sedol('BOATER') === null);
  - text: <code>sedol('228276')</code>应该返回'228276'。
    testString: assert(sedol('228276') === '2282765');

Challenge Seed

function sedol (input) {
  // Good luck!
  return true;
}

Solution

// solution required