Data structure and Algorithms Python language description notes

Data

Linear tables include sequential tables and linked lists, and Python lists are sequential tables, which are generally not used in dynamic languages. But the list will still appear in a variety of algorithm problems.

Linked list:

• Single linked list
• Double linked list

• Circular single-linked list

  String has an important point is the string matching problem, which is more important is no backtracking matching algorithm (KMP algorithm), the algorithm is more complex, the important idea is that the matching process does not backtrack. The actual complexity is O (m+n), M and n are matched pattern string and target string respectively, General M<<n.
• Wildcard characters * and?
  • * Match any one string
  • ？ Match any one character
• Regular expressions

• Original string: Precede string with r prefix, \ not as escape character

Data structure and Algorithms Python language description notes