Announcement

Collapse
No announcement yet.

[Hè 2016] Buổi 3 - STL

Collapse
X
 
  • Filter
  • Time
  • Show
Clear All
new posts

  • #16
    Contains Duplicate: https://leetcode.com/problems/contains-duplicate/
    104ms

    PHP Code:
    class Solution {
    public:

        
    bool containsDuplicate(vector<int>& nums) {
            
    int ijk=0;
            
    int n=nums.size();
            
    map<intintc;
            
            for(
    i=0i<ni++){
                if(
    c[nums[i]]==1) return true;
                else 
    c[nums[i]]=1;
            }
            
            return 
    false;
        }
    }; 

    Comment


    • #17
      Move Zeroes: https://leetcode.com/problems/move-zeroes/
      22ms

      PHP Code:
      class Solution {
      public:
          
      void moveZeroes(vector<int>& nums) {
            
            
      fill(removenums.begin(), nums.end(), 0), nums.end(), 0);
            
          }
      }; 

      Comment


      • #18
        Find the Duplicate: https://leetcode.com/problems/find-t...licate-number/
        Time: 56ms
        PHP Code:
        class Solution {
        public:
                
        int findDuplicate(vector<int> &nums){
                
        int i;
               
        map<int,intc;
               for(
        i=0;i<nums.size();i++){
                   if (
        c.find(nums[i])==c.end()){
                       
        c[nums[i]]=1;
                   }
                   else {
                       return 
        nums[i];
                   }
               }
               return 
        0;
        }
        }; 

        Comment


        • #19
          Remove Element : https://leetcode.com/problems/remove-element/
          Time: 4ms
          PHP Code:
          class Solution {
          public:
              
          int removeElement(vector<int>& numsint val) {
                  for(
          i=0;i<nums.size();i++){
                      if(
          nums[i]==val){
                          
          nums.erase(nums.begin()+i);
                          
          i--;
                      }
                  }
                  return 
          nums.size();
              }
          }; 

          Comment


          • #20
            Majority Element: https://leetcode.com/problems/majority-element/
            Time: 48 ms
            PHP Code:
            class Solution {
            public:
                
            int majorityElement(vector<int>& nums) {
                    
            map<intint>c;
                    
            int i;
                    for(
            i=0;i<nums.size();i++){
                        if (
            c.find(nums[i])==c.end()){ 
                           
            c[nums[i]]=1;
                           if (
            c[nums[i]]>nums.size()/2) return nums[i];
                       } 
                       else { 
                           
            c[nums[i]]++;
                           if (
            c[nums[i]]>nums.size()/2)
                                return 
            nums[i];
                       } 
                    }
                    return 
            0;
                }
            }; 

            Comment

            LHQC

            Collapse
            Working...
            X