算法入门与数组篇——数据结构与算法简介（01.01）

因为题目都很简单，就不写过多的废话，直接贴上代码和截图好啦

1. 第一题
   

class Solution {
public:
    int sum(int num1, int num2) {
        return num1 + num2;
    }
};

2. 第二题
   

class Solution {
public:
    vector<int> getConcatenation(vector<int>& nums) {
        int length = nums.size();
        vector<int>ans(2*length);

        for(int i=0;i<2*length;i++){
            if(i<length){
                ans[i]=nums[i];
            }
            else{
                ans[i] = nums[i-length];
            }
        }
        return ans;
    }
    
};

3. 第三题
   

class Solution {
public:
    int numJewelsInStones(string jewels, string stones) {
        int count = 0;
        int jewelsLength = jewels.size();
        int stonesLength = stones.size();
        for(int i = 0;i<stonesLength;i++){
            char stone = stones[i];
            for(int j=0;j<jewelsLength;j++){
                char jewel= jewels[j];
                if(stone == jewel){
                    count++;
                    break;
                }
            }
        }
        return count;
    }
};

4. 第四题

class Solution {
public:
    vector<int> runningSum(vector<int>& nums) {
        int length = nums.size();
        int sum = 0;
        vector<int> ret(length);
        for(int i=0;i<length;i++){            
            sum = sum + nums[i];
            ret[i] = sum;
        }
        return ret;
    }
};

5. 第五题
   

class Solution {
public:
    string toLowerCase(string s) {
        int length = s.size();
        for(int i = 0;i < length;i++){
            if(s[i]>='A' and s[i]<='Z'){
                s[i] = s[i]+'a'-'A';
            }
        }
        return s;
    }
};

6. 第六题
   

class Solution {
public:
    int maximumWealth(vector<vector<int>>& accounts) {
        int customerCount = accounts.size();
        int bankCount = accounts[0].size();
        int mx=0;
        for(int i =0;i<customerCount;i++){
            int customer =0;
            for(int j = 0;j<bankCount;j++){
                customer = customer + accounts[i][j];
            }
            if (customer > mx){
                mx = customer;
            }
        }
        return mx;
    }
};