Advertisement
Guest User

Untitled

a guest
Dec 15th, 2019
103
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 1.42 KB | None | 0 0
  1. #include<iostream>
  2. #include<string.h>
  3. using namespace std;
  4. int i=0,j=0,k=0,l=0;
  5. void del(char ab[],int n)
  6. {
  7. cout<<"\nA="<<ab;
  8. for(i=n;i<strlen(ab);i++)
  9. ab[i]=ab[i+1];
  10. ab[i]='\0';
  11. }
  12. char* find_common_char(char a[], char b[])
  13. {
  14. k=0;
  15. static char r[50];
  16. int countA=strlen(a);
  17. int countB=strlen(b);
  18. for(i=0;i<countA;i++)
  19. {
  20. for(int j=0;j<countB;j++)
  21. {
  22. if (a[i]==b[j]){
  23. r[k]=a[i];
  24. k++;
  25. }
  26. }
  27. }
  28. r[k]='\0';
  29. for(i=0;i<strlen(r);i++)
  30. {
  31. for(int j=0;j<strlen(r);j++)
  32. {
  33. if(j!=i&&r[i]==r[j]){
  34. del(r,i);
  35. i=0;j=0;
  36. }
  37. }
  38. }
  39. r[i]='\0';
  40. return r;
  41. }
  42. char* find_common_char2(char a[], char b[])
  43. {
  44. k=0;
  45. static char ra[50];
  46. int countA=strlen(a);
  47. int countB=strlen(b);
  48. for(i=0;i<countA;i++)
  49. {
  50. for(int j=0;j<countB;j++)
  51. {
  52. if (a[i]==b[j]){
  53. ra[k]=a[i];
  54. k++;
  55. }
  56. }
  57. }
  58. ra[k]='\0';
  59. for(i=0;i<strlen(ra);i++)
  60. {
  61. for(int j=0;j<strlen(ra);j++)
  62. {
  63. if(j!=i&&ra[i]==ra[j]){
  64. del(ra,i);
  65. i=0;j=0;
  66. }
  67. }
  68. }
  69. ra[i]='\0';
  70. return ra;
  71. }
  72. int main()
  73. {
  74. char a1[20],b1[20],temp1[20],temp2[20];
  75. cout<<"\nEnter string A";
  76. cin>>a1;
  77. cout<<"\nEnter string B";
  78. cin>>b1;
  79. strcpy(temp1,a1);
  80. strcpy(temp2,b1);
  81. cout<<"\ntemp1 and temp2 are   "<<temp1<<"\t"<<temp2;
  82. char* r2=find_common_char(b1,a1);
  83.  
  84. char* r3=find_common_char2(temp1,temp2);
  85. cout<<"\nr2= "<<r2<<"\nr3="<<r3;
  86. cout<<"\n";
  87. cout<<"\nA="<<a1<<strlen(a1);
  88. cout<<"\nB="<<b1<<strlen(b1);
  89. if(strcmp(r2,r3)==0)
  90. cout<<"\nSatsfiescondition";
  91. else
  92. cout<<"\nNot Satisfied";
  93. return 0;
  94. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement