mirror of
https://github.com/Manoj-HV30/dsa-competitive-programming.git
synced 2026-05-16 19:35:22 +00:00
leetcode new problems
This commit is contained in:
@@ -0,0 +1,15 @@
|
||||
class Solution {
|
||||
public:
|
||||
int minimumCost(vector<int>& nums) {
|
||||
int min1 = 100, min2 = 100;
|
||||
int n = nums.size();
|
||||
for(int i = 1;i<n;i++){
|
||||
if(nums[i]<min1){
|
||||
min2 = min1;
|
||||
min1 = nums[i];
|
||||
}else if(nums[i]<min2)
|
||||
min2 = nums[i];
|
||||
}
|
||||
return nums[0] + min1 + min2;
|
||||
}
|
||||
};
|
||||
Reference in New Issue
Block a user