Please Answer it in Java only. Dinner, a kind of noodle soup with rice. Mr. Ping makes the best noodle soup and his son Po is eagerly awaiting user reviews on his father's blog. Users can vote on (+) or -- and +1 or -1 can be added to the number of points respectively. Note that if a user votes multiple times, only his or her latest vote is calculated from the total value. Po opens a blog to see the first 0 points. In order to see updated points without updating the page, they must continue to vote. After each click of Po (+) or (-), he can see the current total points, which takes Po's vote again. He wonders how many users without him would have voted. Judging by the sequence of clicks made by Po and the total number of points displayed immediately after each click, can you tell him the minimum number of users who are likely to vote at least once, without Po.

EBK JAVA PROGRAMMING
9th Edition
ISBN:9781337671385
Author:FARRELL
Publisher:FARRELL
Chapter2: Using Data
Section: Chapter Questions
Problem 19RQ
icon
Related questions
Question
Please Answer it in Java only.
Dinner, a kind of noodle soup with rice. Mr. Ping makes the best noodle soup and his
son Po is eagerly awaiting user reviews on his father's blog. Users can vote on (+) or --
and +1 or -1 can be added to the number of points respectively. Note that if a user
votes multiple times, only his or her latest vote is calculated from the total value.
Po opens a blog to see the first 0 points. In order to see updated points without
updating the page, they must continue to vote. After each click of Po (+) or (-), he can
see the current total points, which takes Po's vote again. He wonders how many users
without him would have voted. Judging by the sequence of clicks made by Po and the
total number of points displayed immediately after each click, can you tell him the
minimum number of users who are likely to vote at least once, without Po.
Input
1
P 1
P 2
Output
1
Transcribed Image Text:Please Answer it in Java only. Dinner, a kind of noodle soup with rice. Mr. Ping makes the best noodle soup and his son Po is eagerly awaiting user reviews on his father's blog. Users can vote on (+) or -- and +1 or -1 can be added to the number of points respectively. Note that if a user votes multiple times, only his or her latest vote is calculated from the total value. Po opens a blog to see the first 0 points. In order to see updated points without updating the page, they must continue to vote. After each click of Po (+) or (-), he can see the current total points, which takes Po's vote again. He wonders how many users without him would have voted. Judging by the sequence of clicks made by Po and the total number of points displayed immediately after each click, can you tell him the minimum number of users who are likely to vote at least once, without Po. Input 1 P 1 P 2 Output 1
Expert Solution
steps

Step by step

Solved in 3 steps with 1 images

Blurred answer
Knowledge Booster
Random Class and its operations
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
EBK JAVA PROGRAMMING
EBK JAVA PROGRAMMING
Computer Science
ISBN:
9781337671385
Author:
FARRELL
Publisher:
CENGAGE LEARNING - CONSIGNMENT