Cracking the Coding Interview Chap1 Q1.3
来源:互联网 发布:windows键盘键位修改 编辑:程序博客网 时间:2024/04/28 15:12
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 UPWrite 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);}}
- Cracking the Coding Interview Chap1 Q1.3
- Cracking the Coding Interview Chap1 Q1.1
- Cracking the Coding Interview Chap1 Q1.2
- Cracking the Coding Interview Chap1 Q1.4
- Cracking the Coding Interview Chap1 Q1.5
- Cracking the coding interview--Q1.3
- Cracking the coding interview--Q1.3
- Cracking the coding interview--Q1.3
- Cracking the coding interview--Q1
- Cracking The Coding Interview--Q1.1
- Cracking the coding interview Q1.1
- Cracking the coding interview--Q1.1
- Cracking the coding interview Q1.1
- Cracking the coding interview Q1.2
- Cracking the coding interview Q1.1
- Cracking the coding interview--Q1.8
- Cracking the coding interview--Q1.1
- Cracking the coding interview--Q1.2
- 交叉验证(CrossValidation)解析
- 杂序
- C++中union结构
- 多线程下载百度分享的大文件
- 最短路径算法
- Cracking the Coding Interview Chap1 Q1.3
- 输入两个整数a和b(b>=0),输出a^b(即a的b次幂)
- poj 1007
- Oracle DB 权限与角色
- 华为2014校园招聘经历_底层软件研发_面试经验
- JAVA的位移运算巧方法
- Unity3d Cg基础知识(1)
- Java单例模式
- 单链表按值操作(单链表)