leetCode/2176.统计数组中相等且可以被整除的数对.html

<!DOCTYPE html>
<html lang="en">
  <head>
    <meta charset="UTF-8" />
    <meta http-equiv="X-UA-Compatible" content="IE=edge" />
    <meta name="viewport" content="width=device-width, initial-scale=1.0" />
    <title>2176. 统计数组中相等且可以被整除的数对</title>
  </head>
  <body>
    <script>
      // https://leetcode.cn/problems/count-equal-and-divisible-pairs-in-an-array/

      // 给你一个下标从 0 开始长度为 n 的整数数组 nums 和一个整数 k ，请你返回满足 0 <= i < j < n ，nums[i] == nums[j] 且 (i * j) 能被 k 整除的数对 (i, j) 的 数目 。
      //
      // 提示：
      // 1 <= nums.length <= 100
      // 1 <= nums[i], k <= 100

      /**
       * @param {number[]} nums
       * @param {number} k
       * @return {number}
       */
      var countPairs = function (nums, k) {};

      // --- answer-1 ---

      // 直接遍历
      var countPairs = function (nums, k) {
        let result = 0;
        for (let i = 0; i < nums.length; i++) {
          for (let j = i + 1; j < nums.length; j++) {
            if (nums[i] == nums[j] && (i * j) % k == 0) {
              result++;
            }
          }
        }
        return result;
      };

      // --- answer-1 ---

      // --- answer-2 ---

      // --- answer-2 ---

      var nums = [3, 1, 2, 2, 2, 1, 3],
        k = 2;
      var result = 4;
      // 解释：

      var nums = [1, 2, 3, 4],
        k = 1;
      var result = 0;
      // 解释：由于数组中没有重复数值，所以没有数对 (i,j) 符合所有要求。

      console.log('nums = ', nums);
      console.log('k = ', k);
      console.log('result = ', result);
      console.log('countPairs = ', countPairs(nums, k));
    </script>
  </body>
</html>