Merge branch 'master' of https://github.com/shivamkumar177/LeetcodeMay

shivamkumar177 · shivamkumar177 · commit 9036e001a845 · 2020-05-17T12:20:29.000+05:30
diff --git a/WEEK 1/Question 6 Majority Element.cpp b/WEEK 1/Question 6 Majority Element.cpp
@@ -19,4 +19,4 @@ class Solution {
         }
         return ans;
     }
-};
+};
diff --git a/WEEK 2/Question 5 Single Element in a Sorted Array.txt b/WEEK 2/Question 5 Single Element in a Sorted Array.txt
@@ -0,0 +1,12 @@
+class Solution {
+public:
+    int singleNonDuplicate(vector<int>& nums) {
+        if(nums.size()==1)return nums[0];
+        for(int i=0,j=1;i<nums.size();i+=2)
+        {
+            if(nums[i]!=nums[j])return nums[i];
+            j+=2;
+        }
+        return nums[nums.size()-1];
+    }
+};
diff --git a/WEEK 2/Question 6 Remove k Digits.txt b/WEEK 2/Question 6 Remove k Digits.txt
@@ -0,0 +1,25 @@
+class Solution {
+public:
+    string removeKdigits(string num, int k) {
+       if(num.length()==k)return "0";
+        stack<char> s;
+        for(char c: num)
+        {
+            while(!s.empty()&&k>0&&s.top()>c)s.pop(),k--;
+            if(!s.empty()||c!='0')s.push(c);
+        }
+        while(!s.empty()&&k--)
+        {
+            s.pop();
+        }
+        int n=num.length();
+        if(s.empty())return "0";
+        while(!s.empty())
+        {
+            num[n-1]=s.top();
+            s.pop();
+            n--;
+        }
+        return num.substr(n);
+    }
+};
