Leetcode - 3Sum With Multiplicity
https://leetcode.com/problems/3sum-with-multiplicity/
Given an integer array A, and an integer target, return the number of tuples i, j, k such that i < j < k and A[i] + A[j] + A[k] == target.
As the answer can be very large, return it modulo 10^9 + 7.
Example 1:
Input: A = [1,1,2,2,3,3,4,4,5,5], target = 8 Output: 20 Explanation: Enumerating by the values (A[i], A[j], A[k]): (1, 2, 5) occurs 8 times; (1, 3, 4) occurs 8 times; (2, 2, 4) occurs 2 times; (2, 3, 3) occurs 2 times.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 | func threeSumMulti(A []int, target int) int { hash := map[int]int{} result := 0 mod := 1000000007 for i := 0; i < len(A); i++ { if v, ok := hash[target - A[i]]; ok { result = (result + v) % mod } for j := 0; j < i; j++ { tmp := A[i] + A[j] hash[tmp]++ } } return result} |
2 年前
According to TRAI rules, operators do not provide International Roaming services by default; therefore, when a customer requires the facility in a BSNL prepaid SIM card, he or she must approach the nearest customer service center for a BSNL SIM replacement with a new unpaired SIM that supports international roaming, international roaming BSNL known as a BSNL DUAL IMSI International roaming SIM, and then, after activating the duplicate SIM, the mobile user must recharge with the below-mentioned pack for successful activation