leetcode两题

class Solution {
public:
    int arrayPairSum(vector<int>& nums) {
      int res=0;
        sort(nums.begin(),nums.end());
        for (int i=0;i<nums.size();i=i+2)
        {
            res+=nums[i];
        }
        return res;
    }
};

Example 1:

Input: [1,4,3,2]

Output: 4
Explanation: n is 2, and the maximum sum of pairs is 4 = min(1, 2) + min(3, 4).

Note:

  1. n is a positive integer, which is in the range of [1, 10000].
  2. All the integers in the array will be in the range of [-10000, 10000].



class Solution {
public:
    int arrayPairSum(vector<int>& nums) {
      int res=0;
        sort(nums.begin(),nums.end());
        for (int i=0;i<nums.size();i=i+2)
        {
            res+=nums[i];
        }
        return res;
    }
};



2

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

Example:
Given s = "hello", return "olleh".



class Solution {
public:
    string reverseString(string s) {
        int lenth=s.length();
        for(int i=0;i<lenth/2;i++)
        {
            char a=s[i];
            s[i]=s[lenth-i-1];
            s[lenth-i-1]=a;
        }
        return s;  
        
    }
};

注:字符串s长度用s.length();

       容器的大小用nums.size()

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值