mirror of
https://gitlab.com/mfocko/LeetCode.git
synced 2024-11-14 01:49:41 +01:00
problems(swift): add “1464. Maximum Product of Two Elements in an Array”
Signed-off-by: Matej Focko <mfocko@redhat.com>
This commit is contained in:
parent
0432d97982
commit
608d678b88
1 changed files with 16 additions and 0 deletions
|
@ -0,0 +1,16 @@
|
||||||
|
class Solution {
|
||||||
|
func maxProduct(_ nums: [Int]) -> Int {
|
||||||
|
var m = 0
|
||||||
|
|
||||||
|
for i in 0..<nums.count - 1 {
|
||||||
|
for j in i + 1..<nums.count {
|
||||||
|
let p = (nums[i] - 1) * (nums[j] - 1)
|
||||||
|
if p > m {
|
||||||
|
m = p
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
return m
|
||||||
|
}
|
||||||
|
}
|
Loading…
Reference in a new issue