There are N balls positioned in a row. Each of them is either red or white. In one move we can swap two adjacent balls. We want to arrange all the red balls into a consistent segment. What is the minimum number of swaps needed? Write a function:

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
i need the answer quickly
?
C-
1
2
3
Task 2
There are N balls positioned in a row. Each of them is either red or white. In one
move we can swap two adjacent balls. We want to arrange all the red balls into a
consistent segment. What is the minimum number of swaps needed?
Write a function:
class Solution {public int solution (String S); }
that, given string S of length N built from characters "R" and "W", representing
red and white balls respectively, returns the minimum number of swaps needed
to arrange all the red balls into a consistent segment. If the result exceeds 10⁹,
return -1.
Examples:
1. Given S="WRRWWR", your function should return 2. We can move the last ball
two positions to the left:
"WRRWRW"
• "WRRRWW"
Programming Language
Java 8
●
SENSEX
+0.58%
2. Given S="WWRWWWRWR", your function should return 4. We can move first
and last red ball towards the middle one:
● "WWWRWWRWR"
"WWWWRWRWR"
"wWwwWRRWR"
"WWWWWRRRW™
All changes saved
V
Q Search.
OC
Files
task2
so
te:
Test Outp
⠀⠀
Transcribed Image Text:? C- 1 2 3 Task 2 There are N balls positioned in a row. Each of them is either red or white. In one move we can swap two adjacent balls. We want to arrange all the red balls into a consistent segment. What is the minimum number of swaps needed? Write a function: class Solution {public int solution (String S); } that, given string S of length N built from characters "R" and "W", representing red and white balls respectively, returns the minimum number of swaps needed to arrange all the red balls into a consistent segment. If the result exceeds 10⁹, return -1. Examples: 1. Given S="WRRWWR", your function should return 2. We can move the last ball two positions to the left: "WRRWRW" • "WRRRWW" Programming Language Java 8 ● SENSEX +0.58% 2. Given S="WWRWWWRWR", your function should return 4. We can move first and last red ball towards the middle one: ● "WWWRWWRWR" "WWWWRWRWR" "wWwwWRRWR" "WWWWWRRRW™ All changes saved V Q Search. OC Files task2 so te: Test Outp ⠀⠀
Expert Solution
steps

Step by step

Solved in 3 steps with 2 images

Blurred answer
Knowledge Booster
Topological Sort
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.
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education