用户名: 密码: 企业 个人
当前位置:89学习网范文文章招聘应聘笔试2017亚马逊在线笔试题目» 正文

2017亚马逊在线笔试题目

[05-15 14:50:43]   来源:http://www.89xue.com  笔试   阅读:90
摘要:2小时,两个题目。在线编程,英文题目。当时没做好,完了自己把他们完成了。答案是我自己写的,自己测试没问题,若有错误请指正。Question 1 / 2Question:We have an array representing customer’s shopping records.For example, it’s an array like this:custA, item1,custB, item1,custA, item2,custB, item3,custC, item1,custC, item3,custD, item2,This array indicates that cu。
2017亚马逊在线笔试题目,标签:笔试范文,http://www.89xue.com

  2小时,两个题目。在线编程,英文题目。当时没做好,完了自己把他们完成了。答案是我自己写的,自己测试没问题,若有错误请指正。

  Question 1 / 2

  Question:

  We have an array representing customer’s shopping records.

  For example, it’s an array like this:

  custA, item1,

  custB, item1,

  custA, item2,

  custB, item3,

  custC, item1,

  custC, item3,

  custD, item2,

  This array indicates that customer A bought item 1, customer B bought item 1, customer A bought item 2, customer B bought item 3, etc..

  For a given item X and shopping records array, write code to find out what else (item Y) was bought mostly by the customers who bought item X.

  For example, in above example, if X is item 1 then Y should be item 3.

  Rules:

  1. One customer can only buy one item once.

  2. The mostly brought item should not be item X.

  3. If no customer brought item X, then return “None”

  4. If all the customers who brought item X only brought item X, then return “None”

  5. The first line of input is the item X. The second line of input is the shopping record array, this shopping record array is split by space.

  6. If there are many other mostly brought items which have equally brought times, then return any one of those items.

  Examples:

  Input1:

  item1

  custA item1 custB item1 custA item2 custB item3 custC item1 custC item3 custD item2

  Output1:

  item3

  Input2:

  item2

  custA item1 custB item1 custC item1 custA item2 custB item3 custA item3

  Output2:

  item1

  (The output2 can be item3 too)

  /* Enter your code here. Read input from STDIN. Print output to STDOUT */

  #include

  #include

  #include

  #include

  #include

  #include

  #include

  using namespace std;

  char* findMostlyBroughtItem(char* shippingRecordArray[], int length, char* givenItem);

  inline bool isSpace(char x){

  return x == ' ' || x == '\r' || x == '\n' || x == '\f' || x == '\b' || x == '\t';

  }

  char * rightTrim(char *str){

  int len = strlen(str);

  while(--len>=0){

  if(isSpace(str[len])){

  str[len] = '\0';

  }else{

  break;

  }

  }

  return str;

  }

  char * getInputLine(char *buffer, int length){

  if(fgets(buffer,length, stdin)==NULL){

  return NULL;

  }

  rightTrim(buffer);

  if(strlen(buffer)<=0){

  return NULL;

  }

  return buffer;

  }

  int splitAndConvert(char* strings,char* array[]){

  char*tokenPtr = strtok(strings," ");

  int i=0;

  while(tokenPtr!=NULL){

  array[i] = tokenPtr;

  i++;

  tokenPtr=strtok(NULL," ");

  }

  return i;

  }

  int main()

  {

  char givenItem[1000] = {0} ;

  while(getInputLine(givenItem, 1000)){

  char line[1000];

  getInputLine(line, 1000);

  char* shoppingRecordArray[1000] = {0};

  int length = splitAndConvert(line,shoppingRecordArray);

[1] [2] [3] [4]  下一页


Tag:笔试笔试范文招聘应聘 - 笔试