Day 7, Data structure in coursera

由于刚上该门课不久，能做的纪录有限。
第一题:
two sum
比leetcode简单很多:

#include<iostream>using namespace std;int main(){    int a,b,sum =0;    cin>>a;    cin>>b;    cout<<a+b<<endl;    return 0}

第二题，
找出最大乘积

#include<iostream>#include<vector>using namespace std;long long MaxPairwiseProduct(const vector<int>& numbers){long long result =0;int n = numbers.size();for(int i=0;i<n;i++){for(int j=i+1; j<n;j++){if((long long)numbers[i] * numbers[j] > result){result = numbers[i]*numbers[j];}}}return result;}int main(){int n;cin>>n;vector<int>numbers(n);for(int i=0;i<n;i++){cin>>numbers[i];}int result = MaxPairwiseProduct(numbers);cout<<result<<"\n";}