Merge pull request #122 from Adarsh08X/master

Leetcode

Author: larissalages

leetcode/cpp/Two Pointer/283.cpp

@@ -0,0 +1,19 @@
+class Solution {
+public:
+    void moveZeroes(vector<int>& nums) {
+        int next=0;
+        for(int i=0;i<nums.size();i++)
+        {
+            if(nums[i])
+            {
+                nums[next]=nums[i];
+                next++;
+            }
+        }
+        for(int i=next;i<nums.size();i++)
+        {
+           nums[i]=0;
+        }
+       
+    }
+};

leetcode/cpp/Two Pointer/75.cpp

@@ -0,0 +1,22 @@
+class Solution {
+public:
+    void sortColors(vector<int>& nums) {
+        int  low=0,mid=0,high=nums.size()-1;
+        while(mid<=high){
+            
+            if(nums[mid]==0)
+            {
+              swap(nums[low],nums[mid]);
+                low++,mid++;
+            }
+            else if(nums[mid]==1)
+            {
+                mid++;
+            }
+            else{
+                swap(nums[mid],nums[high]);
+                high--;
+            }
+        }
+    }
+};

leetcode/cpp/string/459.cpp

@@ -0,0 +1,33 @@
+class Solution {
+public:
+    bool repeatedSubstringPattern(string s) {
+        string t="";
+        if(s.size()==1)
+        {
+     return false;
+        }
+    int n=s.size();
+        for(int i=0;i<s.size()/2;i++)
+        {
+            t+=s[i];
+           // cout<<t<<endl;
+            int x=t.size();
+            if(n%x==0)
+            {
+                string res;
+                for(int j=0;j<n/x;j++)
+                {
+                res+=t;
+                }
+            if(res==s)
+            {
+              //  cout<<res;
+               return true;
+                
+            }
+            }
+            
+        }
+        return false;
+    }
+};

leetcode/cpp/string/520.cpp

@@ -0,0 +1,47 @@
+class Solution {
+public:
+    bool detectCapitalUse(string word) {
+        bool upper=true,lower=true;
+        if(word[0]-'A'>=0&&word[0]-'A'<26)
+        {
+        for(int i=1;i<word.size();i++)
+        {
+            if(word[i]-'a'>=0&&word[i]-'a'<26)
+            {
+                continue;
+            }
+            else{
+                lower=false;
+                break;
+            }
+        }
+        for(int i=1;i<word.size();i++)
+        {
+            if(word[i]-'A'>=0&&word[i]-'A'<26)
+            {
+                continue;
+            }
+            else{
+                upper=false;
+                break;
+            }
+        }
+        }
+        else{
+            upper=false;
+            for(int i=1;i<word.size();i++)
+        {
+            if(word[i]-'a'>=0&&word[i]-'a'<26)
+            {
+                continue;
+            }
+            else{
+                lower=false;
+                break;
+            }
+        }
+        }
+        bool ans=upper|lower;
+        return ans;
+    }
+};