diff --git a/codes/javascript/chapter_computational_complexity/leetcode_two_sum.js b/codes/javascript/chapter_computational_complexity/leetcode_two_sum.js
index 24b5ba84d..8afe1fd4d 100644
--- a/codes/javascript/chapter_computational_complexity/leetcode_two_sum.js
+++ b/codes/javascript/chapter_computational_complexity/leetcode_two_sum.js
@@ -4,11 +4,6 @@
  * Author: gyt95 (gytkwan@gmail.com)
  */
 
-/**
- * @param {number[]} nums
- * @param {number} target
- * @return {number[]}
- */
 function twoSumBruteForce(nums, target) {
     let n = nums.length;
     // 两层循环，时间复杂度 O(n^2)