Commit e296c66

authored

Create 3371. Identify the Largest Outlier in an Array.cpp

1 parent dc3d28d commit e296c66Copy full SHA for e296c66

File tree

+23

-0

lines changed

+23

-0

lines changed

Lines changed: 23 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,23 @@`
	`1`	`+class Solution {`
	`2`	`+public:`
	`3`	`+ int getLargestOutlier(vector<int>& nums) {`
	`4`	`+ int totalsum = 0;`
	`5`	`+ unordered_map<int,int>mp;`
	`6`	`+ for(auto i:nums){`
	`7`	`+ totalsum+=i;`
	`8`	`+ mp[i]++;`
	`9`	`+ }`
	`10`	`+ int ans = INT_MIN;`
	`11`	`+ for(int i=0;i<nums.size();i++){`
	`12`	`+ int temp = totalsum-nums[i];`
	`13`	`+ int outlier = temp-nums[i];`
	`14`	`+ mp[nums[i]]--;`
	`15`	`+ if(mp.find(outlier)!=mp.end() && mp[outlier]!=0){`
	`16`	`+ ans = max(ans,outlier);`
	`17`	`+ }`
	`18`	`+ mp[nums[i]]++;`
	`19`	`+ }`
	`20`	`+ return ans;`
	`21`	`+`
	`22`	`+ }`
	`23`	`+};`

Comments

(0)