• C/C++数据结构:串的五个常用操作


    1. /**
    2. *
    3. * Althor: Hacker Hao
    4. * Create: 2023.10.14
    5. *
    6. */
    7. #include
    8. using namespace std;
    9. #define MAXSIZE 200
    10. #define ERROR -1
    11. #define OK 1
    12. typedef struct
    13. {
    14. char data[MAXSIZE];
    15. int length;
    16. }SqString;
    17. //实现串赋值、串比较、求串长、串联接以及求子串这5种基本操作。
    18. void Assign(SqString &s, char str[])
    19. {
    20. int i = 0;
    21. for (i = 0; str[i] != '\0'; i++)
    22. s.data[i] = str[i];
    23. s.length = i;
    24. }
    25. void Compare(SqString *s1, SqString *s2)
    26. {
    27. int i = 0;
    28. for (i = 0; s1->data[i] != '\0' && s2->data[i] != '\0'; i++)
    29. {
    30. if (s1->data[i] > s2->data[i])
    31. {
    32. cout << "前者大" << endl;
    33. return;
    34. }
    35. if (s1->data[i] < s2->data[i])
    36. {
    37. cout << "后者大" << endl;
    38. return;
    39. }
    40. }
    41. cout << "一样大" << endl;
    42. return;
    43. }
    44. int Length(SqString* s)
    45. {
    46. return s->length;
    47. }
    48. void Concat(SqString* s1, SqString* s2, SqString* s)
    49. {
    50. int t = 0;
    51. if (s1->length + s2->length <= MAXSIZE)
    52. {
    53. for (int i = 0; i < s1->length; i++)
    54. {
    55. s->data[i] = s1->data[i];
    56. }
    57. for (int i = 0, j = s1->length; j < s1->length + s2->length; i++, j++)
    58. {
    59. s->data[j] = s2->data[i];
    60. }
    61. s->length = s1->length + s2->length;
    62. t = s->length;
    63. }
    64. else
    65. {
    66. for (int i = 0; i < s1->length; i++)
    67. {
    68. s->data[i] = s1->data[i];
    69. }
    70. for (int i = 0, j = s1->length; i< MAXSIZE - s1->length; i++, j++)
    71. {
    72. s->data[j] = s2->data[i];
    73. }
    74. t = MAXSIZE;
    75. }
    76. cout << "新的链接好的串为:" << endl;
    77. for (int i = 0; i < t; i++)
    78. {
    79. cout << s->data[i];
    80. }
    81. cout << endl;
    82. }
    83. int SubString(SqString &Sub, SqString s, int pos, int len)
    84. {
    85. if (pos < 1 || pos > s.length || len < 0 || len > s.length - pos + 1)
    86. return ERROR;
    87. for (int i = 0; i < len; i++,pos++)
    88. {
    89. Sub.data[i] = s.data[pos];
    90. }
    91. Sub.length = len;
    92. for (int i = 0; i < len; i++)
    93. {
    94. cout << Sub.data[i];
    95. }
    96. cout << endl;
    97. return OK;
    98. }
    99. int main()
    100. {
    101. cin.tie(0), cout.tie(0);
    102. SqString s1, s2, s3, Sub;
    103. char str1[200] = "hello";
    104. char str2[200] = "nihao";
    105. Assign(s1, str1);
    106. Assign(s2, str2);
    107. Compare(&s1, &s2);
    108. cout << "s1的长度为:" << Length(&s1) << endl;
    109. cout << "s2的长度为:" << Length(&s2) << endl;
    110. Concat(&s1, &s2, &s3);
    111. cout << "输出的字串为:" << endl;
    112. SubString(Sub,s3, 3, 4);
    113. return 0;
    114. }

  • 相关阅读:
    Java虚拟机栈
    基于虚拟化技术的5G核心网资源配置算法
    Django笔记二十九之中间件介绍及使用示例
    java毕业设计儿童教育系统Mybatis+系统+数据库+调试部署
    AQS 框架中 setState() 和 setExclusiveOwnerThread() 方法顺序问题
    Python 爬虫实战之爬淘宝商品并做数据分析
    AS/NZS 1859.3:2017 木基装饰板检测
    技巧与思想——位运算
    递归算法深入解析
    基于PLC除尘设备控制系统的设计
  • 原文地址:https://blog.csdn.net/Hacker_Hao/article/details/133846126