We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Strings
  4. Super Reduced String
  5. Discussions

Super Reduced String

Sort 1407 Discussions, By:

  • tao_zhang
     + 57 comments

    Mine in Java

    import java.util.Scanner;

public class RemoveDuplicateLetters {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        String str = scanner.next();
        for (int i = 1; i < str.length(); i++) {
            if (str.charAt(i) == str.charAt(i-1)) {
                str = str.substring(0, i-1) + str.substring(i+1);
                i = 0;
            }
        }
        if (str.length() == 0) {
            System.out.println("Empty String");
        } else {
            System.out.println (str);
        }
    }
}

  • DasShubhadeep
     + 12 comments

    Simple implementation in C using stack in O(n) time. Do ask for any clarifications.

    #include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>

int main() {

char string[101];
scanf("%s",string);
//printf("%s",string);
char *stack=(char *)malloc(sizeof(char)*strlen(string));

    int top=-1;

    for(int i=0;i<strlen(string);i++){

    if(i==0)
        stack[++top]=string[i];
    else
        {
        if(stack[top]==string[i])
            top--;
        else
            stack[++top]=string[i];


    }



}
if(top==-1)
    printf("Empty String");
else
    {
    for(int i=0;i<=top;i++)
        printf("%c",stack[i]);
}



return 0;
}

  • raka4448
     + 19 comments

    Mine in C++ :

    #include <bits/stdc++.h>
using namespace std;
int main() {
    string s;
    cin >> s;
    for(int i=0;i<(((int)s.length())-1);i++) {
        if(s[i]==s[i+1]){
                s.erase(i,2);
                i=-1;
        }
    }
    cout<<(s.length()?s:"Empty String");
    return 0;
}

  • inxcess
     + 8 comments

    Super simple Python 2 solutions:

    def removeRepeats(S):
    LS = list(S)
    i = 0 
    while i < len(LS)-1:
        if LS[i]==LS[i+1]:
            del LS[i]
            del LS[i]
            i = 0
            if len(LS) == 0:
                print 'Empty String'
                break
        else:
            i+=1
    return ''.join(LS)

  • kodomass
     + 13 comments
    string str; cin >> str;
int i=0;

while(i < static_cast< int > (str.size()-1)) {
	if(i>-1 && str[i] == str[i+1]) {
		str.erase(i,2);
		i--;
	} else
		i++;
}
    
if(str.empty())
	cout << "Empty String" << endl;
else
	cout << str << endl;
Load more conversations