叶予清晨

叶予清晨

hhh
首頁封存

青訓營刷題打卡

33
AI 翻譯
這篇文章透過AI由簡體中文翻譯成繁體中文。查看原文
AI 生成的摘要
這段程式碼涉及多個函數和主函數，主要功能包括數字插入、時間轉換和檢查點的共線性。程式碼中使用了多種數據結構和算法來解決不同的問題，例如將時間字符串轉換為分鐘數、計算向量以檢查點是否共線等。整體上，這些函數展示了如何在C++中進行數據處理和邏輯判斷。

小 U 的數字插入問題#

image

#include <iostream>
using namespace std;

int solution(int a, int b) {
    string s  = to_string(a);  
    string res;
    bool flag=1;
    string temp = to_string(b);
    for(int i=0;i<min(s.length(),temp.length());i++){
        if(temp[i]>s[i]){
            string ss = temp;
            temp = s;
            s = ss;
            break;
        }
    }
    for(int i=0;i<s.length();i++){
        if(flag&&temp[0]>=s[i]&&temp[0]>=s[i+1]){
            flag = 0;
            for(auto q : temp){
                res+=q;
            }
        }
        res+=s[i];
    }
    if(flag == 1)
    {
            for(auto q : temp){
                res+=q;
            }}
    int result = stoi(res);
    return result;
}

int main() {
    cout << (solution(76543, 4) == 765443) << endl;  
    cout << (solution(1, 0) == 10) << endl;  
    cout << (solution(44, 5) == 544) << endl;
    cout << (solution(666, 6) == 6666) << endl;
    return 0;
}

小 M 的奶酪問題#

image

#include <iostream>
#include <string>
using namespace std;
    string solution(int A, int B) {
    // PiLEASE DO NOT MODIFY THE FUNCTION SIGNATURE
    // write code here
    int c = B-A;
    string h = to_string(c);
    string q = to_string(B);
   string s = h+'/'+q;
    return s ;
}

int main() {
    std::cout << (solution(2, 7) == "5/7") << std::endl;
    std::cout << (solution(1, 3) == "2/3") << std::endl;                              
    std::cout << (solution(3, 5) == "2/5") << std::endl;
}

選擇題反選#

略

小 T 的密碼變換規則#

image

#include <iostream>
#include <string>
#include <cctype>

using namespace std;

char charToDigit(char c) {
    if (islower(c)) {
        if (c >= 'a' && c <= 'c') return '2';
        if (c >= 'd' && c <= 'f') return '3';
        if (c >= 'g' && c <= 'i') return '4';
        if (c >= 'j' && c <= 'l') return '5';
        if (c >= 'm' && c <= 'o') return '6';
        if (c >= 'p' && c <= 's') return '7';
        if (c >= 't' && c <= 'v') return '8';
        if (c >= 'w' && c <= 'z') return '9';
    } else if (isupper(c)) {
        c = tolower(c);
        if (c == 'a'){
             return '9';
        } else {
            c--;
           
            if (c >= 'a' && c <= 'c') return '2';
            if (c >= 'd' && c <= 'f') return '3';
            if (c >= 'g' && c <= 'i') return '4';
            if (c >= 'j' && c <= 'l') return '5';
            if (c >= 'm' && c <= 'o') return '6';
            if (c >= 'p' && c <= 's') return '7';
            if (c >= 't' && c <= 'v') return '8';
            if (c >= 'w' && c <= 'z') return '9';
        }

    }
    return c;
}

string solution(const string& s) {
    string result = "";
    for (char c : s) {
        result += charToDigit(c);
    }
    return result;
}

int main() {
    cout << (solution("LIming0701") == "5464640701") << endl;
    cout << (solution("PassW0rd") == "62778073") << endl;
    cout << (solution("helloWORLD123") == "4355686752123") << endl;
    return 0;
}

數值操作的數字期望問題#

image

#include<bits/stdc++.h>
using namespace std;

string solution(int a, int b) {
    double c = 9.0/4*(a+b);
   stringstream ss;
    ss << fixed << setprecision(2) << c;
    string s = ss.str();
    return s;
}

int main() {
    cout << (solution(3, 3) == "13.50") << endl;
    cout << (solution(5, 7) == "27.00") << endl;
    cout << (solution(1, 1) == "4.50") << endl;
    return 0;
}

判斷回旋鏢的存在#

image

#include <iostream>
#include <vector>
using namespace std;

bool solution(vector<vector<int>>& points) {
    // 檢查是否有重複的點
    if ((points[0] == points[1]) || (points[0] == points[2]) || (points[1] == points[2])) {
        return false;
    }

    // 計算向量
    int x1 = points[1][0] - points[0][0];
    int y1 = points[1][1] - points[0][1];
    int x2 = points[2][0] - points[0][0];
    int y2 = points[2][1] - points[0][1];

    // 判斷是否共線
    return (x1 * y2 - x2 * y1) != 0;
}

int main() {
    vector<vector<int>> v1 = {{1, 1}, {2, 3}, {3, 2}};
    vector<vector<int>> v2 = {{1, 1}, {2, 2}, {3, 3}};
    vector<vector<int>> v3 = {{0, 0}, {1, 1}, {1, 0}};

    cout << (solution(v1) == true) << endl;
    cout << (solution(v2) == false) << endl;
    cout << (solution(v3) == true) << endl;
    return 0;
}

小 c 的外賣超時判斷#

image

#include <iostream>
#include <string>
#include <sstream>

using namespace std;

// 將 "HH:MM" 格式的時間字符串轉換為分鐘數
int timeToMinutes(const string& time) {
    stringstream ss(time);
    int hour, minute;
    char colon;
    ss >> hour >> colon >> minute;
    return hour * 60 + minute;
}

string solution(const string& t1, const string& t2, const string& t3) {
    int time1 = timeToMinutes(t1);
    int time2 = timeToMinutes(t2);
    int time3 = timeToMinutes(t3);
    
    // 處理跨天的情況，將時間都轉換為從 0 開始的分鐘數
    if (time2 < time1) {
        time2 += 24 * 60;
    }
     if (time3 < time1) {
         time3 += 24*60;
     }

    // 判斷是否超時
    if (time3 > time2) {
        return "Yes";
    } else {
        return "No";
    }
}

int main() {
    cout << (solution("18:00", "19:05", "19:05") == "No") << endl;
    cout << (solution("23:00", "00:21", "00:23") == "Yes") << endl;
    cout << (solution("23:05", "00:05", "23:58") == "No") << endl;
    return 0;
}

財富評估項目#

image

#include <iostream>
#include <vector>
#include <algorithm> // 引入 <algorithm> 頭文件使用 max 函數
using namespace std;

int solution(std::vector<std::vector<int>> financials) {
    int max_sum = 0;
    for (const auto& customer : financials) {
        int current_sum = 0;
        for (int amount : customer) {
            current_sum += amount;
        }
        max_sum = max(max_sum, current_sum); // 使用 max 函數更新最大資金
    }
    return max_sum;
}

int main() {
    cout << (solution({{2, 4, 6}, {4, 3, 2}}) == 12) << endl;
    cout << (solution({{3, 9}, {8, 2}, {5, 6}}) == 12) << endl;
    cout << (solution({{5, 5, 9, 3}, {6, 2, 3, 1}, {3, 4, 10, 2}}) == 22) << endl;
    return 0;
}

打點計時器的區間合併#

image

#include <iostream>
#include <vector>
#include <algorithm>
#include <set>

using namespace std;

int solution(vector<vector<int>> inputArray) {
    if (inputArray.empty()) return 0;

    // 1. 排序
    sort(inputArray.begin(), inputArray.end());

    // 2. 合併區間
    vector<vector<int>> mergedIntervals;
    mergedIntervals.push_back(inputArray[0]);
    for (size_t i = 1; i < inputArray.size(); ++i) {
        vector<int>& lastInterval = mergedIntervals.back();
        const vector<int>& currentInterval = inputArray[i];

        if (currentInterval[0] <= lastInterval[1]) {
            lastInterval[1] = max(lastInterval[1], currentInterval[1]);
        } else {
            mergedIntervals.push_back(currentInterval);
        }
    }

    // 3. 計算總點數
    int totalPoints = 0;
    for (const auto& interval : mergedIntervals) {
        totalPoints += (interval[1] - interval[0] + 1);
    }

    return totalPoints;
}

int main() {
    vector<vector<int>> testArray1 = {{1, 4}, {7, 10}, {3, 5}};
    vector<vector<int>> testArray2 = {{1, 2}, {6, 10}, {11, 15}};
    vector<vector<int>> testArray3 = {{1, 5}, {2, 4}};
    vector<vector<int>> testArray4 = {{1, 5}, {6, 10}};
     vector<vector<int>> testArray5 = {{}};

    cout << (solution(testArray1) == 9) << endl;
    cout << (solution(testArray2) == 12) << endl;
    cout << (solution(testArray3) == 5) << endl;
    cout << (solution(testArray4) == 10) << endl;
     cout << (solution(testArray5) == 0) << endl;
    return 0;
}

統計班級中的說謊者#

image

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int solution(vector<int> A) {
    int n = A.size();
    int liarCount = 0;

    for (int i = 0; i < n; ++i) {
        int currentScore = A[i];
        int lowerOrEqualCount = 0;
        int higherCount = 0;

        for (int j = 0; j < n; ++j) {
            if (A[j] <= currentScore) {
                lowerOrEqualCount++;
            } else {
                higherCount++;
            }
        }
        if (lowerOrEqualCount > higherCount) {
            liarCount++;
        }
    }
    return liarCount;
}

int main() {
    cout << (solution({100, 100, 100}) == 3) << endl;
    cout << (solution({2, 1, 3}) == 2) << endl;
    cout << (solution({30, 1, 30, 30}) == 3) << endl;
    cout << (solution({19, 27, 73, 55, 88}) == 3) << endl;
    cout << (solution({19, 27, 73, 55, 88, 88, 2, 17, 22}) == 5) << endl;
    return 0;
}

小 M 的多任務下載器#

#include <iostream>
#include <vector>
#include <algorithm>
#include <map>

using namespace std;

int solution(int n, vector<vector<int>> array) {
    map<int, int> timeline; // 使用 map 存儲時間點和任務數量變化
    for (const auto& task : array) {
        int startTime = task[0];
        int endTime = startTime + task[1];
        timeline[startTime]++;     // 任務開始時，任務數量加 1
        timeline[endTime]--;       // 任務結束時，任務數量減 1
    }

    int maxConcurrentTasks = 0;
    int currentConcurrentTasks = 0;
    for (const auto& entry : timeline) {
        currentConcurrentTasks += entry.second;
        maxConcurrentTasks = max(maxConcurrentTasks, currentConcurrentTasks);
    }
    return maxConcurrentTasks;
}

int main() {
    cout << (solution(2, {{1, 2}, {2, 3}}) == 2) << endl;
    cout << (solution(4, {{1, 2}, {2, 3}, {3, 5}, {4, 3}}) == 3) << endl;
     cout << (solution(5 ,{{1, 3}, {3, 4}, {2, 2}, {6, 5}, {5, 3}}) == 3) << endl;
      cout << (solution(1, {{1, 2}}) == 1) << endl;
      cout << (solution(2, {{1, 2}, {3, 4}}) == 1) << endl;
    return 0;
}

反應物濃度#

image

#include <iostream>
#include <string>
#include <vector>
using namespace std;

int solution(vector<string> instructions) {
    int reactant = 0;
    for (const string& instruction : instructions) {
        if (instruction == "++") {
            reactant++;
        } else if (instruction == "--") {
            reactant--;
        }
    }
    return reactant;
}

int main() {
    cout << (solution({"++", "--", "++"}) == 1) << endl;
    cout << (solution({"++", "++", "--", "--"}) == 0) << endl;
    cout << (solution({"++", "++", "--"}) == 1) << endl;
    return 0;
}

字符串解碼問題#

image

#include <iostream>
#include <string>

using namespace std;

string solution(int N, const string& S) {
    string decoded_s = "";
    for (char c : S) {
        if (c == 'x') {
            decoded_s += 'y';
        } else if (c == 'y') {
            decoded_s += 'x';
        } else if (c == 'a') {
            decoded_s += 'b';
        } else if (c == 'b') {
            decoded_s += 'a';
        } else {
            decoded_s += c;
        }
    }
    return decoded_s;
}

int main() {
    cout << (solution(5, "xaytq") == "ybxtq") << endl;
    cout << (solution(6, "abcxyz") == "bacyxz") << endl;
    cout << (solution(3, "zzz") == "zzz") << endl;
    return 0;
}

版本號比較#

image

#include <iostream>
#include <string>
#include <vector>
#include <sstream>

using namespace std;

int solution(string version1, string version2) {
    vector<int> v1, v2;
    
    stringstream ss1(version1);
    string token;
    while(getline(ss1, token, '.')){
        v1.push_back(stoi(token));
    }
    
      stringstream ss2(version2);
   
    while(getline(ss2, token, '.')){
        v2.push_back(stoi(token));
    }


    int i = 0;
    while (i < v1.size() || i < v2.size()) {
        int num1 = (i < v1.size()) ? v1[i] : 0;
        int num2 = (i < v2.size()) ? v2[i] : 0;
        
        if (num1 > num2) return 1;
        if (num1 < num2) return -1;
        
        i++;
    }

    return 0;
}

int main() {
    cout << (solution("0.1", "1.1") == -1) << endl;
    cout << (solution("1.0.1", "1") == 1) << endl;
    cout << (solution("7.5.2.4", "7.5.3") == -1) << endl;
    cout << (solution("1.0", "1.0.0") == 0) << endl;
    cout << (solution("1.0.1","1.0.1") == 0) << endl;
     cout << (solution("1.0.1","1.0") == 1) << endl;
      cout << (solution("1","1.0.1") == -1) << endl;
        cout << (solution("1.0","1") == 0) << endl;
          cout << (solution("1","1.0") == 0) << endl;
             cout << (solution("0.0.1","1") == -1) << endl;
                 cout << (solution("1","0.0.1") == 1) << endl;
    return 0;
}

前綴和#

image

#include <iostream>
#include <vector>

using namespace std;

vector<int> solution(vector<int> nums) {
    int n = nums.size();
    vector<int> prefixSums(n);
    
    if (n == 0) return prefixSums;
    
    prefixSums[0] = nums[0];
    for (int i = 1; i < n; ++i) {
        prefixSums[i] = prefixSums[i - 1] + nums[i];
    }
    return prefixSums;
}

int main() {
    cout << (solution({4, 5, 1, 6}) == vector<int>{4, 9, 10, 16}) << endl;
    cout << (solution({2, 2, 2, 2}) == vector<int>{2, 4, 6, 8}) << endl;
    cout << (solution({7, 3, 9, 4}) == vector<int>{7, 10, 19, 23}) << endl;
    cout << (solution({1, 2, 3}) == vector<int>{1, 3, 6}) << endl;
       cout << (solution({}) == vector<int>{}) << endl;
    return 0;
}

遊戲排名第三大#

image

#include <iostream>
#include <vector>
#include <algorithm>
#include <set>

using namespace std;

int solution(int n, vector<int> nums) {
    set<int> uniqueNums;
    for(int num : nums) {
        uniqueNums.insert(num);
    }
    
    vector<int> sortedUniqueNums(uniqueNums.begin(), uniqueNums.end());
     sort(sortedUniqueNums.rbegin(), sortedUniqueNums.rend());

    if (sortedUniqueNums.size() >= 3) {
        return sortedUniqueNums[2];
    } else {
        return sortedUniqueNums[0];
    }
}

int main() {
    cout << (solution(3, {3, 2, 1}) == 1) << endl;
    cout << (solution(2, {1, 2}) == 2) << endl;
    cout << (solution(4, {2, 2, 3, 1}) == 1) << endl;
    cout << (solution(5, {1,2,3,4,5}) == 3) << endl;
     cout << (solution(1, {5}) == 5) << endl;
     cout << (solution(5, {1,1,1,1,1}) == 1) << endl;
     cout << (solution(5, {1,1,2,2,3}) == 1) << endl;
    return 0;
}
載入中......
此文章數據所有權由區塊鏈加密技術和智能合約保障僅歸創作者所有。