Complete this code/** * Remove adjacent duplicate characters in a string. * For example, delDuplicate("aaabbc") → "abc". * @param input is the input string. * @return the resulting string. */public static String delDuplicate(String input) { // base case // recursive step } Given an input string, delete recursively all the duplicate adjacent characters andreturn a string where all those adjacent characters that are the same have beenreduced to just a single character.Do not use any loops.Do not use any regular expressions and methods such as matches, split,replaceAll.Test case 1:delDuplicate("aaabbc")"abc"Test case 2:delDuplicate("aaaaa")For example:TestResultString input = "aaabbc";abcSystem.out.println(delDuplicate(input));String input = "aaaaa";aSystem.out.println(delDuplicate(input));

Algorithm: Start Implement a method named delDuplicate() that takes a string s as an argument…

Answered: Given an input string, delete…

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Question

100%

Complete this code
/**
* Remove adjacent duplicate characters in a string.
* For example, delDuplicate("aaabbc") → "abc".
* @param input is the input string.
* @return the resulting string.
*/
public static String delDuplicate(String input) {
// base case

// recursive step

}