main

BM-GJB8114-2013/A-1-1-2/A-1-1-2-bad.c

+#define IF0( x ) if ( 0 == ( x ) ) {  //提示1
+
+int main ( void )
+{
+  int test = 0;
+
+  IF0 ( test )
+    test = test + 1;
+  }
+
+  return ( 0 );
+}

BM-GJB8114-2013/A-1-1-2/A-1-1-2-bad.cpp

+#define IF0( x ) if ( 0 == ( x ) ) {  //提示1
+
+int main ( void )
+{
+  int test = 0;
+
+  IF0 ( test )
+    test = test + 1;
+  }
+
+  return ( 0 );
+}

BM-GJB8114-2013/A-1-1-2/A-1-1-2-good.c

+#define IF0( x ) if ( 0 == ( x ) )  //遵循1
+
+int main ( void )
+{
+  int test = 0;
+
+  IF0 ( test )
+  {
+    test = test + 1;
+  }
+
+  return ( 0 );
+}

BM-GJB8114-2013/A-1-1-2/A-1-1-2-good.cpp

+#define IF0( x ) if ( 0 == ( x ) )  //遵循1
+
+int main ( void )
+{
+  int test = 0;
+
+  IF0 ( test )
+  {
+    test = test + 1;
+  }
+
+  return ( 0 );
+}

BM-GJB8114-2013/A-1-6-6/A-1-6-6-bad.c

+int main ( void )
+{
+  int datax, datay, dataz;
+
+  datax = ( datay = 1, dataz = 2 );  //提示1
+
+  return ( 0 );
+}

BM-GJB8114-2013/A-1-6-6/A-1-6-6-bad.cpp

+int main ( void )
+{
+  int datax, datay, dataz;
+
+  datax = ( datay = 1, dataz = 2 );  //提示1
+
+  return ( 0 );
+}

BM-GJB8114-2013/A-1-7-5/A-1-7-5-bad.c

+void fun1 ( int p[ ] )  //提示1
+{
+  int i;
+
+  for ( i = 0; i < 6; i++ )
+  {
+    p[ i ] = p[ i ] + 1;
+  }
+}
+
+void fun2 ( int *p )    //提示2
+{
+  int i;
+
+  for ( i = 0; i < 6; i++ )
+  {
+    p[ i ] = p[ i ] + 1;
+  }
+}
+
+int main ( void )
+{
+  int a[ 6 ] = { 0, 1, 2, 3, 4, 5 };
+
+  fun1 ( a );
+  fun2 ( a );
+
+  return ( 0 );
+}

BM-GJB8114-2013/A-1-7-5/A-1-7-5-bad.cpp

+void fun1 ( int p[ ] )  //提示1
+{
+  int i;
+
+  for ( i = 0; i < 6; i++ )
+  {
+    p[ i ] = p[ i ] + 1;
+  }
+}
+
+void fun2 ( int *p )    //提示2
+{
+  int i;
+
+  for ( i = 0; i < 6; i++ )
+  {
+    p[ i ] = p[ i ] + 1;
+  }
+}
+
+int main ( void )
+{
+  int a[ 6 ] = { 0, 1, 2, 3, 4, 5 };
+
+  fun1 ( a );
+  fun2 ( a );
+
+  return ( 0 );
+}

BM-GJB8114-2013/A-1-7-5/A-1-7-5-good.c

+void fun1 ( int p[ ], int n )  //遵循1
+{
+  int i;
+
+  for ( i = 0; i < n; i++ )
+  {
+    p[ i ] = p[ i ] + 1;
+  }
+}
+
+void fun2 ( int *p, int n )    //遵循2
+{
+  int i;
+
+  for ( i = 0; i < n; i++ )
+  {
+    p[ i ] = p[ i ] + 1;
+  }
+}
+
+int main ( void )
+{
+  int i;
+  int a[ 6 ] = { 0, 1, 2, 3, 4, 5 };
+
+  i = sizeof ( a ) / sizeof ( int );
+  
+  fun1 ( a, i );
+  fun2 ( a, i );
+
+  return ( 0 );
+}

BM-GJB8114-2013/A-1-7-5/A-1-7-5-good.cpp

+void fun1 ( int p[ ], int n )  //遵循1
+{
+  int i;
+
+  for ( i = 0; i < n; i++ )
+  {
+    p[ i ] = p[ i ] + 1;
+  }
+}
+
+void fun2 ( int *p, int n )    //遵循2
+{
+  int i;
+
+  for ( i = 0; i < n; i++ )
+  {
+    p[ i ] = p[ i ] + 1;
+  }
+}
+
+int main ( void )
+{
+  int i;
+  int a[ 6 ] = { 0, 1, 2, 3, 4, 5 };
+
+  i = sizeof ( a ) / sizeof ( int );
+  
+  fun1 ( a, i );
+  fun2 ( a, i );
+
+  return ( 0 );
+}

BM-GJB8114-2013/A-2-7-1/A-2-7-1-bad.cpp

+#include <iostream>
+
+using namespace std;
+
+class Foo
+{
+public:
+  Foo ( void );
+  ~Foo ( void );
+  void SetVar ( int var )  //提示1
+  {
+    a = var;
+  }
+private:
+  int a;
+};
+Foo::Foo ( void )
+{
+  a = 0;
+}
+Foo::~Foo ( void )
+{
+}
+
+int main ( void )
+{
+  Foo thef;
+
+  thef.SetVar ( 2 );
+
+  return ( 0 );
+}

BM-GJB8114-2013/A-2-7-1/A-2-7-1-good.cpp

+#include <iostream>
+
+using namespace std;
+
+class Foo
+{
+public:
+  Foo ( void );
+  ~Foo ( void );
+  void SetVar ( int var );  //遵循1
+private:
+  int a;
+};
+Foo::Foo ( void )
+{
+  a = 0;
+}
+Foo::~Foo ( void )
+{
+}
+void Foo::SetVar ( int var )
+{
+  a = var;
+}
+
+int main ( void )
+{
+  Foo thef;
+
+  thef.SetVar ( 2 );
+
+  return ( 0 );
+}

BM-GJB8114-2013/A-2-8-2/A-2-8-2-bad.cpp

+#include <iostream>
+
+using namespace std;
+
+int main ( void )
+{
+  int i;
+
+  try
+  {
+    int  a1 = 1;
+    int *a2 = new int( 2 );
+
+    if ( i > 10 )
+    {
+      throw &a1;
+    }
+    else
+    {
+      throw a2;
+    }
+  }
+  catch ( int *b )
+  {
+    cout << b << endl;
+    //提示1：是否需要释放动态分配的内存？
+  }
+
+  return ( 0 );
+}

BM-GJB8114-2013/A-2-9-2/A-2-9-2-bad.cpp

+//构造测试例
+
+using namespace std;
+
+int main ( void )
+{
+  int a = 0;
+
+  const int * p1 = &a;  //推荐，指针常数
+  int const * p2 = &a;  //不推荐，指针常数
+  int * const p3 = &a;  //只能如此，常数指针
+
+  int const b = 1;  //不推荐
+  const int c = 2;  //推荐
+
+  return ( 0 );
+}

BM-GJB8114-2013/A-2-9-4/A-2-9-4-bad.cpp

+#include "iostream.h"  //提示1
+
+using namespace std;
+
+int main ( void )
+{
+  cout << "Hello!" << endl;
+
+  return ( 0 );
+}

BM-GJB8114-2013/A-2-9-4/A-2-9-4-good.cpp

+#include <iostream>  //遵循1
+
+using namespace std;
+
+int main ( void )
+{
+  cout << "Hello!" << endl;
+
+  return ( 0 );
+}

BM-GJB8114-2013/R-1-1-1/R-1-1-1-bad.c

+#define long 100  //违背1
+
+int main ( void )
+{
+  int i;
+
+  i = long;
+
+  return ( 0 );
+}

BM-GJB8114-2013/R-1-1-1/R-1-1-1-bad.cpp

+#define long 100  //违背1
+
+int main ( void )
+{
+  int i;
+
+  i = long;
+
+  return ( 0 );
+}

BM-GJB8114-2013/R-1-1-1/R-1-1-1-good.c

+#define LONG_NUM 100  //遵循1
+
+int main ( void )
+{
+  int i;
+
+  i = LONG_NUM;
+
+  return ( 0 );
+}

BM-GJB8114-2013/R-1-1-1/R-1-1-1-good.cpp

+#define LONG_NUM 100  //遵循1
+
+int main ( void )
+{
+  int i;
+
+  i = LONG_NUM;
+
+  return ( 0 );
+}