✨ feat: 1512 好数对的数目;

Author: ConteMan

1512-number-of-good-pairs.js

@@ -0,0 +1,35 @@
+/**
+ * 记录数值出现次数，根据排列组合远离计算符合条件数量
+ * @param {number[]} nums
+ * @return {number}
+ */
+var numIdenticalPairs = function(nums) {
+  let count = 0;
+  const record = {};
+  for (let i = 0; i < nums.length; i++) {
+    record[nums[i]] ? record[nums[i]]++ : record[nums[i]] = 1;
+  }
+  for (let index in record) {
+    if (record[index] > 1) {
+      count += (record[index] * (record[index] - 1)) / 2;
+    }
+  }
+  return count;
+};
+
+/**
+ * 暴力双循环
+ * @param {number[]} nums
+ * @return {number}
+ */
+var numIdenticalPairs = function(nums) {
+  let count = 0;
+  for (let i = 0; i < nums.length; i++) {
+    for (let j = nums.length - 1; j > i; j--) {
+      if (nums[i] === nums[j]) {
+        count++;
+      }
+    }
+  }
+  return count;
+};

1672-richest-customer-wealth.js

@@ -2,7 +2,7 @@
  * @param {number[][]} accounts
  * @return {number}
  */
- var maximumWealth = function(accounts) {
+var maximumWealth = function(accounts) {
   const bankNum = accounts[0].length;
   const customNum = accounts.length;
   let maxWealth = 0;

456-132-pattern.js

@@ -4,7 +4,7 @@
  * @param {number[]} nums
  * @return {boolean}
  */
- var find132pattern = function(nums) {
+var find132pattern = function(nums) {
   const n = nums.length;
   if (n < 3) {
     return false;
@@ -44,7 +44,7 @@
  * @param {number[]} nums
  * @return {boolean}
  */
- var find132pattern = function(nums) {
+var find132pattern = function(nums) {
   const n = nums.length;
   if (n < 3) {
     return false;

73-set-matrix-zeroes.js

@@ -2,7 +2,7 @@
  * @param {number[][]} matrix
  * @return {void} Do not return anything, modify matrix in-place instead.
  */
- var setZeroes = function(matrix) {
+var setZeroes = function(matrix) {
   const m = matrix.length;
   const n = matrix[0].length;
   const flag = matrix[0][0] === 0;

771-jewels-and-stones.js

@@ -3,16 +3,16 @@
  * @param {string} stones
  * @return {number}
  */
- var numJewelsInStones = function(jewels, stones) {
+var numJewelsInStones = function (jewels, stones) {
   let number = 0;
   const stoneArr = [...stones];
   for (let i = 0; i < jewels.length; i++) {
-      for (let k = stoneArr.length; k >= 0; k--) {
-          if (jewels[i] === stoneArr[k]) {
-              stoneArr.splice(k, 1);
-              number++;
-          }
+    for (let k = stoneArr.length; k >= 0; k--) {
+      if (jewels[i] === stoneArr[k]) {
+        stoneArr.splice(k, 1);
+        number++;
       }
+    }
   }
   return number;
-};
+};

82-remove-duplicates-from-sorted-list-ii.js

@@ -9,7 +9,7 @@
  * @param {ListNode} head
  * @return {ListNode}
  */
- var deleteDuplicates = function(head) {
+var deleteDuplicates = function(head) {
   let dummy = new ListNode(0, head);
 
   let current = dummy;

83-remove-duplicates-from-sorted-list.js

@@ -9,7 +9,7 @@
  * @param {ListNode} head
  * @return {ListNode}
  */
- var deleteDuplicates = function(head) {
+var deleteDuplicates = function(head) {
   if (!head) {
     return head;
   }

README.md

@@ -1,4 +1,6 @@
-Record LeetCode.
+Record LeetCode.  
+
+[1512. 好数对的数目](./1512-number-of-good-pairs.js)  
 [771. 宝石与石头](./771-jewels-and-stones.js)  
 [82. 删除排序链表中的重复元素II](./82-remove-duplicates-from-sorted-list-ii.js)  
 [83. 删除排序链表中的重复元素](./83-remove-duplicates-from-sorted-list.js)