# LeetCode 前端挑戰 - 1
##### 2022/3/15
### TwoSum

/**
 * @param {number[]} nums
 * @param {number} target
 * @return {number[]}
 */
var twoSum = function(nums, target) {
    for(var i=0; i<nums.length; i++){
      for(var j=i+1; j<nums.length; j++)
          if(nums[i]+nums[j]===target) return ([i,j])
  }
};

### Zigzag Conversion

/**
 * @param {string} s
 * @param {number} numRows
 * @return {string}
 */
var convert = function(s, numRows) {
    if(numRows == 1)
        return s
    let result = ""
    let gap = numRows*2 - 2;
    for(let row=0; row<numRows;row++) {
        for(let i=row; i<s.length; i+=gap) {
            //主幹的字
            result += s[i];
            //中間的字
            if(row>0 && row<numRows-1) {
                let middleIndex = i+gap-row*2
                if(middleIndex < s.length)
                    result += s[middleIndex]
            }
        }
    }
    return result;
};

###### tags: `LeetCode`