剑指Offer--035-第一个只出现一次的字符位置--http://blog.csdn.net/gatieme/article/details/51319158

gatieme · gatieme · commit f9a04b7c26bd · 2016-07-30T12:32:46.000+08:00
diff --git a/035-第一个只出现一次的字符位置/01-bruteforce.cpp b/035-第一个只出现一次的字符位置/01-bruteforce.cpp
@@ -1,8 +1,10 @@
 #include <iostream>
 #include <iomanip>
 
+
 using namespace std;
 
+
 #define __tmain main
 
 #ifdef __tmain
@@ -19,56 +21,61 @@ using namespace std;
 
 class Solution
 {
+
 public:
+
     int FirstNotRepeatingChar(string str)
     {
         if(str.length( ) == 0)
         {
             return -1;
         }
+
         unsigned int length = str.length( );
         unsigned int i, j;
-        bool flag = true;
+        bool isrepeat = false;
+
+
         for(i = 0; i < length; i++)
         {
-            flag = true;
+            isrepeat = false;
             if(str[i] == '\0')
             {
                 continue;
             }
             debug <<"str[" <<setfill('0')<<setw(2)<<i <<"] = " <<str[i] <<endl;
 
+            //  堆每一个当前字符i判断其后面有没有跟它相同的字符
             for(j = i + 1; j < length; j++)
             {
-                debug <<"str[" <<i <<"] = " <<str[i] <<", ";
-                debug <<"str[" <<j <<"] = " <<str[j] <<endl;;
+                debug <<"str[" <<i <<"] = " <<str[i] <<", "
+                      <<"str[" <<j <<"] = " <<str[j] <<endl;;
 
                 if(str[j] == '\0')
                 {
                     continue;
                 }
-                else if(str[i] == str[j])
+                else if(str[i] == str[j])   // 将所有与当前i位置字符相同的字符都置为'\0'
                 {
                     debug <<str[i] <<str[j] <<endl;
                     str[j] = '\0';
-                    flag = false;
+                    isrepeat = true;
                     //break;
                 }
-
             }
-            if(flag == true)
+            if(isrepeat == false)
             {
                 return i;
             }
-        }       
-        return -1; 
+        }
+        return -1;
     }
 };
 
 int __tmain( )
 {
     Solution solu;
     cout <<solu.FirstNotRepeatingChar("google") <<endl;
-    
+
     return 0;
 }
diff --git a/035-第一个只出现一次的字符位置/02-bitmap.cpp b/035-第一个只出现一次的字符位置/02-bitmap.cpp
@@ -1,8 +1,10 @@
 #include <iostream>
 #include <cstring>
 
+
 using namespace std;
 
+
 #define __tmain main
 
 #ifdef __tmain
@@ -18,7 +20,9 @@ using namespace std;
 
 class Solution
 {
+
 public:
+
     int FirstNotRepeatingChar(string str)
     {
         int x[26] = {0}, y[26] = {0};
@@ -29,7 +33,7 @@ class Solution
             if('a' <= str[i] && str[i] <= 'z')
             {
                 if(x[str[i] - 'a'] == 0)
-                {   
+                {
                     //  �״γ��ֱ������λ��
                     x[str[i] - 'a'] = i + 1;
                 }
@@ -47,7 +51,7 @@ class Solution
                      //  �״γ��ֱ������λ��
                      y[str[i] - 'A']= i + 1;
                 }
-                else 
+                else
                 {
                     //  ���ֶ��, ���ñ�ʶ-1
                     y[str[i] - 'A'] = -1;
diff --git a/035-第一个只出现一次的字符位置/03-count.cpp b/035-第一个只出现一次的字符位置/03-count.cpp
@@ -1,8 +1,10 @@
 #include <iostream>
 #include <cstring>
 
+
 using namespace std;
 
+
 #define __tmain main
 
 #ifdef __tmain
@@ -19,8 +21,10 @@ using namespace std;
 
 class Solution
 {
+
 protected:
     int count[256];
+
 public:
     int FirstNotRepeatingChar(string str)
     {
@@ -60,9 +64,9 @@ int __tmain( )
     int a = -1;
     unsigned int b = a;
     printf("%u\n", b);
-    
+
     Solution solu;
     cout <<solu.FirstNotRepeatingChar("abcdefg") <<endl;
-    
+
     return 0;
 }
diff --git a/035-第一个只出现一次的字符位置/README.md b/035-第一个只出现一次的字符位置/README.md
@@ -1,20 +1,27 @@
 #链接
-------- 
+-------
 >牛客OJ：[第一个只出现一次的字符位置](http://www.nowcoder.com/practice/1c82e8cf713b4bbeb2a5b31cf5b0417c?tpId=13&tqId=11187&rp=2&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking)
-> 
+>
 >九度OJ：http://ac.jobdu.com/problem.php?pid=1283
-> 
+>
 >GitHub代码： [035-第一个只出现一次的字符位置](https://github.com/gatieme/CodingInterviews/tree/master/035-第一个只出现一次的字符位置)
 >
 >CSDN题解：[剑指Offer--035-第一个只出现一次的字符位置](http://blog.csdn.net/gatieme/article/details/51319158)
 
 
-| 牛客OJ | 九度OJ | CSDN题解 | GitHub代码 | 
-| ------------- |:-------------:| -----:| 
+| 牛客OJ | 九度OJ | CSDN题解 | GitHub代码 |
+| ------ |:------:| --------:|:----------:|
 |[035-第一个只出现一次的字符位置](http://www.nowcoder.com/practice/1c82e8cf713b4bbeb2a5b31cf5b0417c?tpId=13&tqId=11187&rp=2&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking) | [1283-第一个只出现一次的字符位置](http://ac.jobdu.com/problem.php?pid=1283) | [剑指Offer--035-第一个只出现一次的字符位置](http://blog.csdn.net/gatieme/article/details/51319158) | [035-第一个只出现一次的字符位置](https://github.com/gatieme/CodingInterviews/tree/master/035-第一个只出现一次的字符位置) |
 
 
 
+
+<br>**您也可以选择[回到目录-剑指Offer--题集目录索引](http://blog.csdn.net/gatieme/article/details/51916802)**
+
+
+
+
+
 #题意
 -------
 
@@ -72,8 +79,8 @@ public:
             {
                 return i;
             }
-        }       
-        return -1; 
+        }
+        return -1;
     }
 };
 ```
@@ -128,9 +135,9 @@ public:
 #bitmap方法-同计数法，略微有变动
 -------
 
-我们计数数组不简单的存储计数 
-* 只出现一次的字符会存储出现的位置 
-* 出现多次的字符就存储标识-1 
+我们计数数组不简单的存储计数
+* 只出现一次的字符会存储出现的位置
+* 出现多次的字符就存储标识-1
 因此查找数组中非-1的最小值即可
 
 
@@ -149,7 +156,7 @@ public:
             if('a' <= str[i] && str[i] <= 'z')
             {
                 if(x[str[i] - 'a'] == 0)
-                {   
+                {
                     //  首次出现保存出现位置
                     x[str[i] - 'a'] = i + 1;
                 }
@@ -167,7 +174,7 @@ public:
                      //  首次出现保存出现位置
                      y[str[i] - 'A']= i + 1;
                 }
-                else 
+                else
                 {
                     //  出现多次, 就置标识-1
                     y[str[i] - 'A'] = -1;
@@ -196,4 +203,4 @@ public:
         return res > str.size() ? -1 : res - 1;
     }
 };
-```
+```
diff --git a/Makefile b/Makefile
@@ -32,14 +32,14 @@ COMMIT_31="剑指Offer--031-连续子数组的最大和--http://blog.csdn.net/ga
 COMMIT_32="剑指Offer--032-整数中1出现的次数（从1到n整数中1出现的次数）--http://blog.csdn.net/gatieme/article/details/51292339"
 COMMIT_33="剑指Offer--033-把数组排成最小的数--http://blog.csdn.net/gatieme/article/details/51303662"
 COMMIT_34="剑指Offer--034-丑数--http://blog.csdn.net/gatieme/article/details/51308037"
-COMMIT_35="剑指Offer--034-丑数--http://blog.csdn.net/gatieme/article/details/51308037"
+COMMIT_35="剑指Offer--035-第一个只出现一次的字符位置--http://blog.csdn.net/gatieme/article/details/51319158"
 COMMIT_36=""
 
 RETURN_TOP ="<br>**您也可以选择[回到目录-剑指Offer--题集目录索引](http://blog.csdn.net/gatieme/article/details/51916802)**"
 
 
 
-GITHUB_COMMIT=$(COMMIT_34)
+GITHUB_COMMIT=$(COMMIT_35)
 
 
 all:github

Original file line number	Diff line number	Diff line change
`@@ -1,8 +1,10 @@`
`1`	`1`	`#include <iostream>`
`2`	`2`	`#include <iomanip>`
`3`	`3`
	`4`	`+`
`4`	`5`	`using namespace std;`
`5`	`6`
	`7`	`+`
`6`	`8`	`#define __tmain main`
`7`	`9`
`8`	`10`	`#ifdef __tmain`
`@@ -19,56 +21,61 @@ using namespace std;`
`19`	`21`
`20`	`22`	`class Solution`
`21`	`23`	`{`
	`24`	`+`
`22`	`25`	`public:`
	`26`	`+`
`23`	`27`	`int FirstNotRepeatingChar(string str)`
`24`	`28`	`{`
`25`	`29`	`if(str.length( ) == 0)`
`26`	`30`	`{`
`27`	`31`	`return -1;`
`28`	`32`	`}`
	`33`	`+`
`29`	`34`	`unsigned int length = str.length( );`
`30`	`35`	`unsigned int i, j;`
`31`		`- bool flag = true;`
	`36`	`+ bool isrepeat = false;`
	`37`	`+`
	`38`	`+`
`32`	`39`	`for(i = 0; i < length; i++)`
`33`	`40`	`{`
`34`		`- flag = true;`
	`41`	`+ isrepeat = false;`
`35`	`42`	`if(str[i] == '\0')`
`36`	`43`	`{`
`37`	`44`	`continue;`
`38`	`45`	`}`
`39`	`46`	`debug <<"str[" <<setfill('0')<<setw(2)<<i <<"] = " <<str[i] <<endl;`
`40`	`47`
	`48`	`+ // 堆每一个当前字符i判断其后面有没有跟它相同的字符`
`41`	`49`	`for(j = i + 1; j < length; j++)`
`42`	`50`	`{`
`43`		`- debug <<"str[" <<i <<"] = " <<str[i] <<", ";`
`44`		`- debug <<"str[" <<j <<"] = " <<str[j] <<endl;;`
	`51`	`+ debug <<"str[" <<i <<"] = " <<str[i] <<", "`
	`52`	`+ <<"str[" <<j <<"] = " <<str[j] <<endl;;`
`45`	`53`
`46`	`54`	`if(str[j] == '\0')`
`47`	`55`	`{`
`48`	`56`	`continue;`
`49`	`57`	`}`
`50`		`- else if(str[i] == str[j])`
	`58`	`+ else if(str[i] == str[j]) // 将所有与当前i位置字符相同的字符都置为'\0'`
`51`	`59`	`{`
`52`	`60`	`debug <<str[i] <<str[j] <<endl;`
`53`	`61`	`str[j] = '\0';`
`54`		`- flag = false;`
	`62`	`+ isrepeat = true;`
`55`	`63`	`//break;`
`56`	`64`	`}`
`57`		`-`
`58`	`65`	`}`
`59`		`- if(flag == true)`
	`66`	`+ if(isrepeat == false)`
`60`	`67`	`{`
`61`	`68`	`return i;`
`62`	`69`	`}`
`63`		`- }`
`64`		`- return -1;`
	`70`	`+ }`
	`71`	`+ return -1;`
`65`	`72`	`}`
`66`	`73`	`};`
`67`	`74`
`68`	`75`	`int __tmain( )`
`69`	`76`	`{`
`70`	`77`	`Solution solu;`
`71`	`78`	`cout <<solu.FirstNotRepeatingChar("google") <<endl;`
`72`		`-`
	`79`	`+`
`73`	`80`	`return 0;`
`74`	`81`	`}`
Original file line number	Diff line number	Diff line change
`@@ -1,8 +1,10 @@`
`1`	`1`	`#include <iostream>`
`2`	`2`	`#include <cstring>`
`3`	`3`
	`4`	`+`
`4`	`5`	`using namespace std;`
`5`	`6`
	`7`	`+`
`6`	`8`	`#define __tmain main`
`7`	`9`
`8`	`10`	`#ifdef __tmain`
`@@ -18,7 +20,9 @@ using namespace std;`
`18`	`20`
`19`	`21`	`class Solution`
`20`	`22`	`{`
	`23`	`+`
`21`	`24`	`public:`
	`25`	`+`
`22`	`26`	`int FirstNotRepeatingChar(string str)`
`23`	`27`	`{`
`24`	`28`	`int x[26] = {0}, y[26] = {0};`
`@@ -29,7 +33,7 @@ class Solution`
`29`	`33`	`if('a' <= str[i] && str[i] <= 'z')`
`30`	`34`	`{`
`31`	`35`	`if(x[str[i] - 'a'] == 0)`
`32`		`- {`
	`36`	`+ {`
`33`	`37`	`// 首次出现保存出现位置`
`34`	`38`	`x[str[i] - 'a'] = i + 1;`
`35`	`39`	`}`
`@@ -47,7 +51,7 @@ class Solution`
`47`	`51`	`// 首次出现保存出现位置`
`48`	`52`	`y[str[i] - 'A']= i + 1;`
`49`	`53`	`}`
`50`		`- else`
	`54`	`+ else`
`51`	`55`	`{`
`52`	`56`	`// 出现多次, 就置标识-1`
`53`	`57`	`y[str[i] - 'A'] = -1;`