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;
    }
};
c++
class Solution:
    def reverseString(self, s):
        """
        :type s: str
        :rtype: str
        """
        return s[::-1]
python3

 

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;
    }
};
c++

 

转载于:https://www.cnblogs.com/yoyo-sincerely/p/7794435.html

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值