leetcode new problems

This commit is contained in:
2026-02-11 14:48:41 +05:30
parent 192ce44a81
commit 0f52d46c67
29 changed files with 658 additions and 5 deletions
+15
View File
@@ -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;
}
};