MinimumTimeToColorRope.java

/*
 * 
 * Minimum Time to make the Rope Colorful.
 * Leetcode Question - 1578.
 * 
 * In this code I have used the Greedy Approach To solve this question.
 */


publicclassMinimumTimeToColorRope {
publicstaticvoidmain(String[] args) {
inttime[] = {1,2,3,4,5}; //Time in Seconds
Stringcolors = "abaac"; //Colors Sequence
System.out.println(minCost(colors, time)); //Total Time Taken to make the rope colorfull
 }
publicstaticintminCost(Stringcolors, int[] neededTime) {
intsec = 0;
charc = ' ';
intcp = 0;
for(inti=0;i<colors.length();i++)
 {
if(colors.charAt(i) == c)
 {
if(cp < neededTime[i])
 {
sec += cp;
cp = neededTime[i];
 }
else
sec += neededTime[i];
 }
else
 {
c = colors.charAt(i);
cp = neededTime[i];
 }
 }
returnsec;
 }
}