2014亞馬遜線上筆試題目

OpenSoucre發表於2014-10-09
亞馬遜筆試

參考http://www.cnblogs.com/jiabei521/p/3348780.html出的題目

1、

題目的意思是

　　1xN的棋盤上，每個格子有一定的分值，現在有m個卡片，每個卡片上有1~4四種數值，代表走幾步，類似小時候的飛行棋遊戲，現在有個人站在位置0的初始點，抽取一張卡片，然後根據卡片上的數值向前移動，然後獲取移動後人所在的位置的分值，然後累加，求最後所能得到的最大分數。

解題思路：

　　就是將m個卡片全排列，每種排列代表一種走法，然後算最大累積分值，直接利用c++的next_permutation列舉全排列函式即可。

原始碼：　

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

using namespace std;

int main(){
    int n,m;
    cin >> n >>m ;
    vector<int> score(n,0), cards(m,0);
    for(int i = 0 ; i < n; ++ i) cin >> score[i];
    for(int i = 0;  i < m; ++ i) cin >> cards[i];
    int res = 0;
    do{
        int sum = score[0],index = 0;
        for(int i = 0; i < m; ++ i){
            index +=cards[i];
            if(index >= n) break;
            sum +=score[index];
        }
        res = max(res,sum);
    }while(next_permutation(cards.begin(),cards.end()));
    cout<<res<<endl;
}

2、Amazon Campus(2013-Sep-24)Question 2 / 2 (Amazon Campus（17）:Find the differences of items in amazon)

Amazon has millions of different items in different categories right now, so when sellers want to sell items in our website, sellers want to find the right categories their items belong to.  Suppose we want to build a system to help sellers find the minimal differences items and then find the right category. The difference index is a number that sum of single-word edits (insertion, deletion, substitution) required to change one phrase into the other:
For example, we get two lines from standard input Hadoop in practice
Hadoop operations
The difference index  of ‘Hadoop in practice’ and ‘Hadoop operations’ is 2. Because we can remove ‘practice’ and substitute ‘in’ with ‘operations’, then ‘Hadoop in practice’ can convert to ‘Hadoop operations’

For example, we get two lines from standard input
Hadoop cookbook
Hadoop operations
The difference index of ‘Hadoop cookbook’ and ‘Hadoop operations’ is 1. Because we can substitute ‘cookbook’ with ‘operations’ then convert 'Hadoop cookbook' can convert to 'Hadoop operations'

For example, we get two lines from standard input:
Ruby in action
Hadoop operations
The difference index of ‘Ruby in action’ and ‘Hadoop operations’ is 3. Because we can substitute ‘Ruby’ with ‘Hadoop’, ‘in’ with ‘operations’ and remove ‘action’ then 'Ruby in action' can convert to 'Hadoop operations'

字串距離的變形題

將字串按照空格分割，然後放入vector中，然後利用動態規劃求解

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

vector<string> split(string& str){
    stringstream ss;
    ss << str;
    vector<string> res;
    string tmp;
    while(ss >> tmp) res.push_back(tmp);
    return res;
}

int distanceBetweenString(string& str1,string& str2){
    if(str1 == str2) return 0;
    vector<string> word1=split(str1);
    vector<string> word2=split(str2);
    int len1 = word1.size(),len2 = word2.size();
    if(len1 == 0) return len2;
    if(len2 == 0) return len1;
    vector<vector<int> > dp(len1+1, vector<int>(len2+1,0));
    for(int i = 0; i <= len1; ++ i) dp[i][0] = i;
    for(int j = 0; j <= len2; ++ j) dp[0][j] = j;
    for(int i =1; i <= len1; ++ i){
        for(int j = 1; j <= len2; ++ j){
            dp[i][j] = min(dp[i-1][j-1]+(word1[i-1] != word2[j-1]? 1: 0),min(dp[i-1][j]+1, dp[i][j-1]+1));
        }
    }
    return dp[len1][len2];
}

int main(){
    string str1,str2;
    getline(cin,str1);
    getline(cin,str2);
    cout<<distanceBetweenString(str1,str2)<<endl;
}

　　

相關文章