Python 3.0：算法与数据结构解题指南

需积分: 9 76 浏览量更新于2024-07-19 2 收藏 3.17MB PDF 举报

"《使用Python解决算法与数据结构问题》（Release 3.0）是一本专为初学者设计的英文教材，由Brad Miller和David Ranum编著，出版日期为2013年9月22日。本书以Python语言为基础，系统地介绍了数据结构和算法的基本概念，旨在帮助读者掌握解决问题的实用技巧。首先，章节1是介绍，明确了学习目标，包括理解计算机科学的核心概念，复习Python基础语法，并通过一系列练习引导读者入门。作者强调了问题解决的重要性，以及算法在其中的作用。第二部分（第2章）探讨了算法分析，讲解了算法性能评估的方法，比较了Python中不同数据结构的执行效率。读者将了解到算法分析的目的和意义，如何评估算法的效率，并通过讨论和编程实践来加深理解。接下来，核心内容集中在基本数据结构的学习上。第3章详细阐述了线性结构，如栈、队列和双端队列，以及它们的抽象数据类型实现。通过列表和有序列表（如链表）的讲解，读者可以掌握不同类型数据结构的工作原理和应用场景。每章末尾都有讨论问题和编程练习，以巩固理论知识并提升实践能力。第4章专门讲解递归，解释了递归的概念，展示了递归函数的实现和栈帧在其中的作用。视觉辅助工具也被用于帮助读者更好地理解递归过程。《Problem Solving with Algorithms and Data Structures Using Python [Release 3.0]》是一本实用的教程，适合那些希望通过Python学习和应用数据结构和算法解决实际问题的读者。它不仅涵盖了基础知识，还提供了丰富的实例和练习，使读者能够逐步提升算法设计和优化的能力。无论对于初学者还是有一定经验的开发者，都能从中受益匪浅。"

Problem Solving with Algorithms and Data Structures, Release 3.0

Method Name Use Explanation

append a_list.append(item) Adds a new item to the end of a list

insert a_list.insert(i,item) Inserts an item at the 𝑖

position in a list

pop a_list.pop() Removes and returns the last item in a list

pop a_list.pop(i) Removes and returns the 𝑖

item in a list

sort a_list.sort() Modiﬁes a list to be sorted

reverse a_list.reverse() Modiﬁes a list to be in reverse order

del del a_list[i] Deletes the item in the 𝑖

position

index a_list.index(item) Returns the index of the ﬁrst occurrence of item

count a_list.count(item) Returns the number of occurrences of item

remove a_list.remove(item) Removes the ﬁrst occurrence of item

Table 1.3: Methods Provided by Lists in Python

following session:

my_list = [1,2,3,4]

A = [my_list]

print(A)

my_list[2]=45

print(A)

The variable A holds a collection of three references to the original list called my_list. Note

that a change to one element of my_list shows up in all three occurrences in A.

Lists support a number of methods that will be used to build data structures. Table 1.3 provides

a summary. Examples of their use follow.

my_list = [1024, 3, True, 6.5]

my_list.append(False)

print(my_list)

my_list.insert(2,4.5)

print(my_list)

print(my_list.pop())

print(my_list)

print(my_list.pop(1))

print(my_list)

my_list.pop(2)

print(my_list)

my_list.sort()

print(my_list)

my_list.reverse()

print(my_list)

print(my_list.count(6.5))

print(my_list.index(4.5))

my_list.remove(6.5)

print(my_list)

del my_list[0]

print(my_list)

12 Chapter 1. Introduction

Problem Solving with Algorithms and Data Structures, Release 3.0

You can see that some of the methods, such as pop, return a value and also modify the list.

Others, such as reverse, simply modify the list with no return value. pop will default to

the end of the list but can also remove and return a speciﬁc item. The index range starting

from 0 is again used for these methods. You should also notice the familiar “dot” notation

for asking an object to invoke a method. my_list.append(False) can be read as “ask the

object my_list to perform its append method and send it the value False.” Even simple

data objects such as integers can invoke methods in this way.

>>> (54).__add__(21)

>>>

In this fragment we are asking the integer object 54 to execute its add method (called __add__

in Python) and passing it 21 as the value to add. The result is the sum, 75. Of course, we usually

write this as 54 + 21. We will say much more about these methods later in this section.

One common Python function that is often discussed in conjunction with lists is the range

function. range produces a range object that represents a sequence of values. By using the

list function, it is possible to see the value of the range object as a list. This is illustrated

below.

>>> range(10)

range(0, 10)

>>> list(range(10))

[0, 1, 2, 3, 4, 5, 6, 7, 8, 9]

>>> range(5,10)

range(5, 10)

>>> list(range(5,10))

[5, 6, 7, 8, 9]

>>> list(range(5,10,2))

[5, 7, 9]

>>> list(range(10,1,-1))

[10, 9, 8, 7, 6, 5, 4, 3, 2]

>>>

The range object represents a sequence of integers. By default, it will start with 0. If you

provide more parameters, it will start and end at particular points and can even skip items. In

our ﬁrst example, range(10), the sequence starts with 0 and goes up to but does not include

10. In our second example, range(5, 10) starts at 5 and goes up to but not including 10.

range(5, 10, 2) performs similarly but skips by twos (again, 10 is not included).

Strings are sequential collections of zero or more letters, numbers and other symbols. We call

these letters, numbers and other symbols characters. Literal string values are differentiated

from identiﬁers by using quotation marks (either single or double).

>>> "David"

'David'

>>> my_name = "David"

>>> my_name[3]

1.4. Review of Basic Python 13

剩余239页未读，继续阅读

Myst21Sid

粉丝: 3
资源: 8

Python 3.0：算法与数据结构解题指南

problem-solving-with-algorithms-and-data-structure-using-python 中文版

Problem Solving with Algorithms and Data Structures using Python 中文版

Problem Solving with Algorithms and Data Structures using Python

Problem Solving with Algorithms and Data Structures Using Python

Problem Solving with Algorithms and Data Structures 黄哥Python培训推荐材.pdf - 快捷方式

Problem Solving in Data Structures and Algorithms Using Python epub 0分

Problem Solving Algorithms and Data Structures

Problem Solving in Data Structures and Algorithms Using Python 无水印pdf 0分

Problem Solving in Data Structures Algorithms Using Python

Problem Solving in Data Structures and Algorithms Using Java mobi

最新资源