华为OD机试-转盘寿司（C++ Java Python）

 

题目描述:寿司店周年庆，正在举办优惠活动回馈新老客户。寿司转盘上总共有n盘寿司，prices[i]是第i盘寿司的价格，如果客户选择了第i盘寿司，寿司店免费赠送客户距离第i盘寿司最近的下一盘寿司j，前提是prices[j]

Java解法：

import java.util.Scanner;
 
 
public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        
        String s = in.nextLine();
        String[] s_prices = s.split(" ");
        int len = s_prices.length;
        int[] prices = new int[len];
        for(int i = 0; i < len; i++){
            prices[i] = Integer.parseInt(s_prices[i]);
        }
        for(int i = 0; i < len; i++){
            int price = prices[i];
            for(int j = (i + 1) % len; j != i; j = (j + 1)%len){
                if(prices[i] > prices[j]){
                    price += prices[j];
                    break;
                }
            }
            System.out.print(price + " ");
        }
    }
}

C++解法：

#include 
#include 
#include 
 
using namespace std;
 
vector calculatePrices(const vector& prices) {
    int n = prices.size();
    vector result(n, 0);  // 存储最终的结果
 
    for (int i = 0; i < n; i++) {
        result[i] = prices[i]; // 首先将结果设为当前寿司的价格
        int next_gift = -1;    // 用于记录找到的下一盘便宜的寿司索引
 
        // 寻找从i+1开始的第一个价格低于prices[i]的寿司，并考虑环形结构
        for (int j = 1; j < n; j++) {
            int index = (i + j) % n;
            if (prices[index] < prices[i]) {
                next_gift = index;
                break;
            }
        }
 
        // 如果找到了合适的寿司，更新结果
        if (next_gift != -1) {
            result[i] += prices[next_gift];
        }
    }
 
    return result;
}
 
int main() {
    string line;
    getline(cin, line);  // 从标准输入读取一行
    istringstream iss(line);
    vector prices;
    int price;
 
    // 使用istringstream从行中解析出价格
    while (iss >> price) {
        prices.push_back(price);
    }
 
    // 计算结果
    vector results = calculatePrices(prices);
 
    // 输出结果
    for (int i = 0; i < results.size(); i++) {
        if (i != 0) cout << " ";
        cout << results[i];
    }
    cout << endl;
 
    return 0;
}

Python解法：

import sys
 
 
def findFriend(N,height):
  rlt = []
  for i in range(N - 1):
    child = height[i]
    tag = True
    for j in range(i + 1, N):
      if height[j] < child:
         rlt.append(height[j])
         tag = False
         breakif t
      if tag:
        rlt.append(0)
  rlt.append(0)
  return rlt
 
if __name__ == "__main__":
  try:
    prices = sys.stdin.readline().strip()
    prices = list(map(int, prices.split()))
    ori_N=len(prices)
 
    prices.extend(prices)
    N=len(prices)
 
    youhui=findFriend(N,prices)
    real_price= [prices[i]+youhui[i] for i in range(N)]
 
    print(" ".join([str(i) for i in real_price[0:ori_N]]))
  except:
    print("0")