alter

Author: Hawstein

1.3.cpp

@@ -113,6 +113,5 @@ int main()
     removeDuplicate5(ss4);
     removeDuplicate5(ss5);
     cout<<ss1<<" "<<ss2<<" "<<ss3<<" "<<ss4<<" "<<ss5<<endl;
-    //cout<<removeDuplicate1(s6)<<" "<<removeDuplicate2(s6)<<endl;
     return 0;
 }

1.4

@@ -3,17 +3,19 @@
 #include <algorithm>
 using namespace std;
 
-bool isAnagram1(string s, string t)
-{
+bool isAnagram1(string s, string t){
+    if(s=="" || t=="") return false;
+    if(s.length() != t.length()) return false;
+    
     sort(&s[0], &s[0]+s.length());
     sort(&t[0], &t[0]+t.length());
     if(s == t) return true;
     else return false;
 }
-bool isAnagram(string s, string t)
-{
+bool isAnagram(string s, string t){
     if(s=="" || t=="") return false;
     if(s.length() != t.length()) return false;
+    
     int len = s.length();
     int c[256];
     memset(c, 0, sizeof(c));
@@ -31,6 +33,6 @@ int main()
     string s = "aaabbb";
     string t = "ababab";
     //cout<<isAnagram(s, t)<<endl;
-    cout<<isAnagram1(s, t)<<endl;
+    cout<<isAnagram(s, t)<<endl;
     return 0;
 }

1.4.cpp

@@ -2,8 +2,8 @@
 #include <cstring>
 using namespace std;
 
-char* replace1(char *c)
-{
+char* replace1(char *c){
+    if(c == NULL) return NULL;
     int len = strlen(c);
     if(len == 0) return NULL;
     int cnt = 0;
@@ -12,7 +12,7 @@ char* replace1(char *c)
         if(c[i] == ' ')
             ++cnt;
     }
-    char *cc = new char[len+2*cnt];
+    char *cc = new char[len+2*cnt+1];
     int p = 0;
     for(int i=0; i<len; ++i)
     {
@@ -33,8 +33,8 @@ char* replace1(char *c)
     return cc;
 }
 
-void replace2(char *c)
-{
+void replace2(char *c){
+    if(c == NULL) return;
     int len = strlen(c);
     if(len == 0) return;
     int cnt = 0;
@@ -44,8 +44,7 @@ void replace2(char *c)
             ++cnt;
     }
     int p = len + 2*cnt;
-    c[p] = '\0';//the space must be allocated first.
-    --p;
+    c[p--] = '\0';//the space must be allocated first.
     for(int i=len-1; i>=0; --i)
     {
         if(c[i] == ' ')
@@ -62,10 +61,9 @@ void replace2(char *c)
         }
     }
 }
-int main()
-{
+int main(){
     const int len = 100;
-    char c[len] = "i am  tom";
+    char c[len] = "";
     cout<<replace1(c)<<endl;
     replace2(c);
     cout<<c<<endl;

1.5

@@ -1,38 +1,34 @@
 #include <iostream>
 using namespace std;
 
-void swap(int &a, int &b)
-{
+void swap(int &a, int &b){
     int t = a;
     a = b;
     b = t;
 }
-void transpose(int a[][4], int n)
-{
+void transpose(int a[][4], int n){
     for(int i=0; i<n; ++i)
         for(int j=i+1; j<n; ++j)
             swap(a[i][j], a[j][i]);
     for(int i=0; i<n/2; ++i)
         for(int j=0; j<n; ++j)
             swap(a[i][j], a[n-1-i][j]);
 }
-int main()
-{
+int main(){
     int a[4][4] = {
         {1, 2, 3, 4},
         {5, 6, 7, 8},
         {9, 10, 11, 12},
         {13, 14, 15, 16}
     };
-    for(int i=0; i<4; ++i)
-    {
+    for(int i=0; i<4; ++i){
         for(int j=0; j<4; ++j)
             cout<<a[i][j]<<" ";
         cout<<endl;
     }
+    cout<<endl;
     transpose(a, 4);
-    for(int i=0; i<4; ++i)
-    {
+    for(int i=0; i<4; ++i){
         for(int j=0; j<4; ++j)
             cout<<a[i][j]<<" ";
         cout<<endl;

1.5.cpp

@@ -2,20 +2,18 @@
 #include <cstdio>
 using namespace std;
 
-void zero(int **a, int m, int n)
-{
-    int *row = new int[m];
-    int *col = new int[n];
+void zero(int **a, int m, int n){
+    bool *row = new bool[m];
+    bool *col = new bool[n];
     for(int i=0; i<m; ++i)
         for(int j=0; j<n; ++j)
-            if(a[i][j] == 0)
-            {
-                row[i] = 1;
-                col[j] = 1;
+            if(a[i][j] == 0){
+                row[i] = true;
+                col[j] = true;
             }
     for(int i=0; i<m; ++i)
         for(int j=0; j<n; ++j)
-            if(row[i]==1 || col[j]==1)
+            if(row[i] || col[j])
                 a[i][j] = 0;
 }
 int main()
@@ -31,9 +29,14 @@ int main()
     for(int i=0; i<m; ++i)
         for(int j=0; j<n; ++j)
             cin>>a[i][j];
+    for(int i=0; i<m; ++i){
+        for(int j=0; j<n; ++j)
+            cout<<a[i][j]<<" ";
+        cout<<endl;
+    }
+    cout<<endl;
     zero(a, m, n);
-    for(int i=0; i<m; ++i)
-    {
+    for(int i=0; i<m; ++i){
         for(int j=0; j<n; ++j)
             cout<<a[i][j]<<" ";
         cout<<endl;

1.6

@@ -2,19 +2,20 @@
 #include <string>
 using namespace std;
 
-bool isRotation(string s1, string s2)
-{
+bool isSubstring(string s1, string s2){
+    if(s1.find(s2) != string::npos) return true;
+    else return false;
+}
+bool isRotation(string s1, string s2){
     if(s1.length() != s2.length() || s1.length()<=0)
         return false;
-    s1 += s1;
-    if(s1.find(s2) >= 0) return true;
-    else return false;
+    return isSubstring(s1+s1, s2);
 }
 
-int main()
-{
-    string s1 = "a";
-    string s2 = "a";
-    cout<<isRotation(s1, s2);
+int main(){
+    string s1 = "apple";
+    string s2 = "pleap";
+    cout<<isRotation(s1, s2)<<endl;
+    //cout<<string::npos<<endl;
     return 0;
 }

1.6.cpp

@@ -6,10 +6,14 @@ void printLastKLines(ifstream &fin, int k){
     string line[k];
     int lines = 0;
     string tmp;
-    while(getline(fin, tmp) && !fin.eof()){
+    while(getline(fin, tmp)){//&& !fin.eof()
         line[lines%k] = tmp;
         ++lines;
     }
+    // while(!fin.eof()){
+    //     getline(fin, line[lines%k]);
+    //     ++lines;
+    // }
     int start, cnt;
     if(lines < k){
         start = 0;

1.7

@@ -38,7 +38,7 @@ node* addlink(node *p, node *q){
         c = t/10;
         p = p->next; q = q->next;
     }
-    if(p){
+    while(p){
         int t = p->data + c;
         node *r = new node();
         r->data = t%10;
@@ -47,7 +47,7 @@ node* addlink(node *p, node *q){
         c = t/10;
         p = p->next;
     }
-    if(q){
+    while(q){
         int t = q->data + c;
         node *r = new node();
         r->data = t%10;
@@ -73,9 +73,9 @@ void print(node *head){
 }
 
 int main(){
-    int n = 4;
+    int n = 5;
     int a[] = {
-        1, 2, 9, 3
+        1, 2, 9, 9, 3
     };
     int m = 3;
     int b[] = {