[Java] One Iteration Solution
\n    int m1 = 1; // second largest num\n    int m2 = 1; // largest num\n    for (int i=0; i<nums.length; i++){\n      if (nums[i] >= m2) {\n        m1 = m2;\n 
```\n    int m1 = 1; // second largest num\n    int m2 = 1; // largest num\n    for (int i=0; i<nums.length; i++){\n      if (nums[i] >= m2) {\n        m1 = m2;\n        m2 = nums[i];\n        continue;\n      } else if(nums[i] > m1) {\n        m1 = nums[i];\n        continue;\n      }\n    }\n    return (m2-1)*(m1-1);\n\t```
[]