Advertisement
Guest User

Untitled

a guest
Dec 10th, 2019
118
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.69 KB | None | 0 0
  1. import java.util.ArrayList;
  2. import java.util.LinkedHashSet;
  3. import java.util.List;
  4. import java.util.Scanner;
  5. import java.util.Set;
  6.  
  7. public class Main {
  8.  
  9. public static void main(String[] args) {
  10. Scanner input = new Scanner(System.in);
  11. Scanner input1 = new Scanner(System.in);
  12. List<String> orders = new ArrayList<>();
  13. int[] price = new int[10];
  14. int orderPrice = 0;
  15. int calculatedPrice;
  16. int orderQty;
  17. int arrayIndex = 0;
  18. String order, answer;
  19. boolean loop = false;
  20.  
  21. do {
  22.  
  23. System.out.print("Enter your order code here: ");
  24. order = input.next().toUpperCase();
  25.  
  26.  
  27. switch(order) {
  28.  
  29. case "C1": orders.add("1 pc. Chicken Joy with rice and drink");
  30. orderPrice = 89;
  31. break;
  32. case "Y1": orders.add("Yamburger with drink");
  33. orderPrice = 69;
  34.  
  35. break;
  36. default:
  37. break;
  38.  
  39. }
  40. System.out.print("For how many orders?: ");
  41. orderQty = input1.nextInt();
  42. calculatedPrice = orderPrice * orderQty;
  43. price[arrayIndex] = calculatedPrice;
  44.  
  45. System.out.print("Any other orders?Y/N: ");
  46. answer = input.next().toUpperCase();
  47.  
  48. switch(answer) {
  49.  
  50. case "Y": loop = true;
  51. arrayIndex += 1;
  52. break;
  53. case "N": loop = false;
  54. //to make sure there are no duplicates in the list
  55. Set<String> newOrders = new LinkedHashSet<String>(orders);
  56. orders.clear();
  57. //arrayList cleared
  58. orders.addAll(newOrders);
  59. //add all elements from set without duplicates
  60.  
  61. for(int i = 0; i < orders.size(); i++) {
  62.  
  63. System.out.println(orders.get(i) + " " + price[i]);
  64.  
  65. }
  66.  
  67. }
  68.  
  69.  
  70. }while (loop);
  71.  
  72. input.close();
  73.  
  74. }
  75.  
  76. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement