chore(i8n,learn): processed translations

curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/harshad-or-niven-series.md

@@ -1,24 +1,34 @@
 ---
 id: 595668ca4cfe1af2fb9818d4
-title: Harshad或Niven系列
+title: Harshad or Niven series
 challengeType: 5
-videoUrl: ''
+forumTopicId: 302281
 dashedName: harshad-or-niven-series
 ---
 
 # --description--
 
-<p> <a href='http://mathworld.wolfram.com/HarshadNumber.html' title='链接：http：//mathworld.wolfram.com/HarshadNumber.html'>Harshad</a>或Niven数是正整数≥1，可以被它们的数字之和整除。 </p><p>例如，42是<a href='http://rosettacode.org/wiki/oeis:A005349' title='OEIS：A005349'>Harshad数，</a>因为42可以被（4 + 2）整除而没有余数。 </p>假设系列被定义为按递增顺序排列的数字。任务： <p>实现一个函数来生成Harshad序列的连续成员。 </p><p>使用它列出序列的前20个成员并列出第一个大于1000的Harshad数。 </p>
+The Harshad or Niven numbers are positive integers ≥ 1 that are divisible by the sum of their digits.
+
+For example, `42` is a [Harshad number](https://rosettacode.org/wiki/Harshad_or_Niven_series "Harshad or Niven series") as `42` is divisible by `(4 + 2)` without remainder.
+
+Assume that the series is defined as the numbers in increasing order.
+
+# --instructions--
+
+Implement a function to generate successive members of the Harshad sequence.
+
+Use it to list the first twenty members of the sequence and list the first Harshad number greater than 1000.
 
 # --hints--
 
-`isHarshadOrNiven`是一个函数。
+`isHarshadOrNiven` should be a function.
 
 ```js
 assert(typeof isHarshadOrNiven === 'function');
 ```
 
-`isHarshadOrNiven()`应该返回`{"firstTwenty": [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 18, 20, 21, 24, 27, 30, 36, 40, 42],"firstOver1000": 1002}`
+`isHarshadOrNiven()` should return `{"firstTwenty": [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 18, 20, 21, 24, 27, 30, 36, 40, 42],"firstOver1000": 1002}`
 
 ```js
 assert.deepEqual(isHarshadOrNiven(), res);