Cracking the Coding Interview Chap1 Q1.3

Q1.3 Design an algorithm and write code to remove the duplicate characters in a string without using any additional buffer. 

NOTE: One or two additional variables are fine. An extra copy of the array is not.

FOLLOW UP

Write the test cases for this method.


For each character, check if it is a duplicate of already found characters

Skip duplicate characters and update the non duplicate characters


public class ccChap1_3 {
	public static void main(String[] args){
		String str = "TTestBaBa";
		
		System.out.println(str);
		
		System.out.println(removeDupStr(str));
		
	}
	
	public static String removeDupStr(String strr){
		char[] str =strr.toCharArray();
		 if (strr == null) return strr;
		 int len = str.length;
		 if (len < 2) return strr;
		
		 int tail = 1;
		 
		 for(int i=1;i<len;++i){
			 int j;
			 for (j=0;j<tail;++j){
				 if (str[i]==str[j]) break;					 
			}
			if(j==tail){
				str[tail]=str[i];
				++tail;
			}
		 }
		 return new String(str, 0, tail);

	
}
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值