Cracking The Coding Interview 1.3
2014-04-01 16:28
281 查看
//原文: // // 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. // // 循环遍历整个数组,一个索引值用来指向去除后的字符串,检查每个字符,如果前面存在,就设为‘\0’,否则迁移 #include <iostream> using namespace std; void duplicate(char *str) { if (str==NULL) { return; } int size = strlen(str); int p = 0; for (int i = 0 ; i < size ; i++) { bool isExist = false; for (int j = 0 ; j < p ; j++) { if (str[j] == str[i]) { isExist = true; } } if (!isExist) { str[p]=str[i]; p++; } else str[i]='\0'; } str[p]='\0'; } int main() { char s[]="whenssssss"; duplicate(s); cout<<s<<endl; return 0; }
相关文章推荐
- Cracking The Coding Interview 3rd -- 1.3
- Cracking the Coding Interview Q1.3
- cracking the coding interview No1.3
- cracking the coding interview problem solution 1.3
- { Cracking The Coding Interview: 150 programming Q&A } 5th edition Part I
- Cracking the Coding Interview Q1.2
- 《Cracking the Coding Interview》——第2章:链表——题目7
- 《Cracking the Coding Interview》——第3章:栈和队列——题目6
- 《Cracking the Coding Interview》——第5章:位操作——题目5
- Cracking the Coding Interview Q2.3
- 《Cracking the Coding Interview》——第9章:递归和动态规划——题目1
- [Cracking the Coding Interview] Chapter 3 - Stacks and Queues
- Cracking the coding interview--14.1-14.6
- Cracking the coding interview--Q1.1
- 《Cracking the Coding Interview》——第11章:排序和搜索——题目8
- Cracking the coding interview 第一章问题及解答
- 渣基础:比照Hawstein学Cracking the coding interview(4)
- cracking the coding interview No1.4
- Cracking The Coding Interview 1.6
- Cracking The Coding Interview3.4 暂存