Advertisement
Guest User

nem_oo.cpp

a guest
Mar 2nd, 2015
291
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.20 KB | None | 0 0
  1. #include <iostream>
  2. #include <cstring>
  3. #include "nem_oo.h"
  4.  
  5. namespace sajat{
  6.  
  7. int atoi(const char *p, int base)
  8. {
  9. int atvaltott,n,i;
  10. for(i=strlen(p)-1,n=1,atvaltott=0;i>=0;i--,n*=base)
  11. {
  12. if((p[i]<'0') || (p[i]>'0'+base-1))
  13. throw "Hibás karakter";
  14. atvaltott+=(p[i]-'0')*n;
  15.  
  16. }
  17. return atvaltott;
  18.  
  19. }
  20.  
  21. char *strcat(const char *p1, const char *p2)
  22. {
  23. int i, j;
  24.  
  25. for (i = 0; p1[i] != '\0'; ++i)
  26. ;
  27. for (j = 0; p2[j] != '\0'; ++j)
  28. ++i;
  29. char *uj = new char[i + 1];
  30. for (i = 0, j = 0; p1[i] != '\0'; ++i, ++j)
  31. uj[j] = p1[i];
  32. for (i = 0; p2[i] != '\0'; ++i, ++j)
  33. uj[j] = p2[i];
  34. uj[j] = '\0';
  35. return uj;
  36.  
  37. }
  38.  
  39. void swap(int &r1, int &r2)
  40. {
  41. int x=r1;
  42. r1=r2;
  43. r2=x;
  44. }
  45.  
  46. char* unique(char *first, char *last)
  47. {
  48. char *vege=last;
  49. for(unsigned int i=strlen(first)-1;i>=0;i--)
  50. {
  51. int j=i-1;
  52. if(first[i]==first[j])
  53. {
  54. for(unsigned int k=j;k<strlen(first);k++) first[k]=first[k+1];
  55. vege--;
  56. }
  57.  
  58. }
  59. vege++;
  60. return vege;
  61.  
  62. }
  63. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement