2017/11/6 Leetcode 日记

2017/11/6 Leetcode 日记

344. Reverse String

Write a function that takes a string as input and returns the string reversed.

class Solution {
public:
    string reverseString(string s) {
        int i = 0, sz = s.size()-1;
        for(i = 0; i < sz; i++, sz--){
            char temp = s[i];
            s[i] = s[sz];
            s[sz] = temp;
        }
        return s;
    }
};

class Solution:
    def reverseString(self, s):
        """
        :type s: str
        :rtype: str
        """
        return s[::-1]

575. Distribute Candies

Given an integer array with even length, where different numbers in this array represent different kinds of candies. Each number means one candy of the corresponding kind. You need to distribute these candies equally in number to brother and sister. Return the maximum number of kinds of candies the sister could gain.

Note:

1. The length of the given array is in range [2, 10,000], and will be even.
2. The number in given array is in range [-100,000, 100,000].

class Solution {
public:
    int distributeCandies(vector<int>& candies) {
        int sz = candies.size();
        unordered_set<int> sets = {};
        unordered_set<int>::const_iterator got;
        for(int i = 0; i < sz; i++){
            got = sets.find(candies[i]);
            if (got == sets.end())
                sets.insert(candies[i]);
        }
        if (sets.size() <= sz/2) return sets.size();
        else return sz/2;
    }
};