Welcome to OGeek Q&A Community for programmer and developer-Open, Learning and Share
Welcome To Ask or Share your Answers For Others

Categories

0 votes
765 views
in Technique[技术] by (71.8m points)

python - How can I check if a list index exists?

Seems as though

if not mylist[1]:
    return False

Doesn't work.

See Question&Answers more detail:os

与恶龙缠斗过久,自身亦成为恶龙;凝视深渊过久,深渊将回以凝视…
Welcome To Ask or Share your Answers For Others

1 Reply

0 votes
by (71.8m points)

You just have to check if the index you want is in the range of 0 and the length of the list, like this

if 0 <= index < len(list):

it is actually internally evaluated as

if (0 <= index) and (index < len(list)):

So, that condition checks if the index is within the range [0, length of list).

Note: Python supports negative indexing. Quoting Python documentation,

If i or j is negative, the index is relative to the end of the string: len(s) + i or len(s) + j is substituted. But note that -0 is still 0.

It means that whenever you use negative indexing, the value will be added to the length of the list and the result will be used. So, list[-1] would be giving you the element list[-1 + len(list)].

So, if you want to allow negative indexes, then you can simply check if the index doesn't exceed the length of the list, like this

if index < len(list):

Another way to do this is, excepting IndexError, like this

a = []
try:
    a[0]
except IndexError:
    return False
return True

When you are trying to access an element at an invalid index, an IndexError is raised. So, this method works.


Note: The method you mentioned in the question has a problem.

if not mylist[1]:

Lets say 1 is a valid index for mylist, and if it returns a Falsy value. Then not will negate it so the if condition would be evaluated to be Truthy. So, it will return False, even though an element actually present in the list.


与恶龙缠斗过久,自身亦成为恶龙;凝视深渊过久,深渊将回以凝视…
OGeek|极客中国-欢迎来到极客的世界,一个免费开放的程序员编程交流平台!开放,进步,分享!让技术改变生活,让极客改变未来! Welcome to OGeek Q&A Community for programmer and developer-Open, Learning and Share
Click Here to Ask a Question

...