Day1&&Day2&&Day3 LHH112(复刻版)



#include <iostream> #include <vector> #include <map> using namespace std; class Solution { public: vector<int> twoSum(vector<int> &nums, int target) { vector<int> answer; for (int i = 0; i <nums.size(); i++) { for (int j = i + 1; j< nums.size(); j++) { if (nums[i]+nums[j] == target) { answer.push_back(i); answer.push_back(j); //returnanswer; } } } return answer; } voidtest1() { Solution s; vector<int> nums = {2, 7,11, 15}; int target = 17; vector<int> temp =s.twoSum(nums, target); cout << temp[0] <<temp[1]; } vector<int> twoSum1(vector<int> &numbers, int target) { int n = numbers.size(); vector<int> result; map<int, int> index; for (int i = 0; i < n; i++){ cout << "first: i= " << i << " "; if(index.count(numbers[i]) != 0) { cout <<index[numbers[i]]<< numbers[i]; // if exists result.push_back(index[numbers[i]]); result.push_back(i); break; } cout << "second: i=" << i; index[target -numbers[i]] = i; } return result; } voidtest2() { Solution s; vector<int> nums = {2, 7,11, 15}; int target = 13; vector<int> temp =s.twoSum1(nums, target); cout << temp[0] <<temp[1]; } };

 

#include <iostream>

#include <cstdio>

#include <cstring>

int main() {

      charstr[128];

      gets(str);

      int count= 0;

      int len =strlen(str);

      if (len< 5000) {

              for (int i = (len - 1); i >=0; i--) {

                      if (str[i] != ' ') {

                              count++;

                      } else {

                              cout<<"shut down cause we meeet ' '" << endl;

 

                              break;

                      }

              }

      }

      cout<< count << endl;

      return 0;

}

 

#include <iostream>

#include <cstdio>

#include <cstring>

{

 string s1;

 string s2;

 // chars1[128];

 // chars2[128];

 // gets(s1);

 // gets(s2);

 getline(cin,s1);

 cin >>s2;

 s2[0] =toupper(s2[0]);

 int count = 0;

 for (int j = 0;j<s1.length(); j++){

  s1[j] =toupper(s1[j]);

 }

 for (int i = 0;i<s1.length(); i++){

  if (s2[0] ==s1[i])

   count++;

 }

 cout <<count;

 return 0;

 }

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值