chore(i8n,learn): processed translations

curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/factors-of-an-integer.md

@@ -1,36 +1,38 @@
 ---
 id: 597f1e7fbc206f0e9ba95dc4
-title: 整数因子
+title: Factors of an integer
 challengeType: 5
-videoUrl: ''
+forumTopicId: 302265
 dashedName: factors-of-an-integer
 ---
 
 # --description--
 
-<p>编写一个返回正整数因子的函数。 </p><p>这些因子是正整数，通过该正整数可以将被分解的数量除以产生正整数结果。 </p> ///
+Write a function that returns the factors of a positive integer as an array.
+
+These factors are the positive integers by which the number being factored can be divided to yield a positive integer result.
 
 # --hints--
 
-`factors`是一种功能。
+`factors` should be a function.
 
 ```js
 assert(typeof factors === 'function');
 ```
 
-`factors(45)`应该返回`[1,3,5,9,15,45]` 。
+`factors(45)` should return `[1,3,5,9,15,45]`.
 
 ```js
 assert.deepEqual(factors(45), ans[0]);
 ```
 
-`factors(53)`应该返回`[1,53]` 。
+`factors(53)` should return `[1,53]`.
 
 ```js
 assert.deepEqual(factors(53), ans[1]);
 ```
 
-`factors(64)`应该返回`[1,2,4,8,16,32,64]` 。
+`factors(64)` should return `[1,2,4,8,16,32,64]`.
 
 ```js
 assert.deepEqual(factors(64), ans[2]);