Notice: This page requires JavaScript to function properly.
Please enable JavaScript in your browser settings or update your browser.
Lære Negative Indexation | Strings
Data Types in Python

Sveip for å vise menyen

book
Negative Indexation

In the preceding chapter, it appeared that we were counting letters to determine the index corresponding to each letter. If we intend to access the final symbol, manual counting may seem cumbersome.

Python, however, is considerate and anticipates our needs. Consequently, it introduced negative indexing. To obtain the last character of a word, it is advisable to utilize the syntax word[-1].

Note

The negative indexation starts from -1, then -2, etc. word[-0] is the same as word[0] for Python.

A small piece of advice: We can mentally divide a string into two parts and use positive indexation for the left-hand part and negative indexation for the right-hand part, but it's always up to us.😏

Oppgave

Swipe to start coding

Achieve the following symbols a, g, e using negative indexation.

Løsning

Switch to desktopBytt til skrivebordet for virkelighetspraksisFortsett der du er med et av alternativene nedenfor
Alt var klart?

Hvordan kan vi forbedre det?

Takk for tilbakemeldingene dine!

Seksjon 3. Kapittel 5
single

single

Spør AI

expand

Spør AI

ChatGPT

Spør om hva du vil, eller prøv ett av de foreslåtte spørsmålene for å starte chatten vår

close

Awesome!

Completion rate improved to 2.94

book
Negative Indexation

In the preceding chapter, it appeared that we were counting letters to determine the index corresponding to each letter. If we intend to access the final symbol, manual counting may seem cumbersome.

Python, however, is considerate and anticipates our needs. Consequently, it introduced negative indexing. To obtain the last character of a word, it is advisable to utilize the syntax word[-1].

Note

The negative indexation starts from -1, then -2, etc. word[-0] is the same as word[0] for Python.

A small piece of advice: We can mentally divide a string into two parts and use positive indexation for the left-hand part and negative indexation for the right-hand part, but it's always up to us.😏

Oppgave

Swipe to start coding

Achieve the following symbols a, g, e using negative indexation.

Løsning

Switch to desktopBytt til skrivebordet for virkelighetspraksisFortsett der du er med et av alternativene nedenfor
Alt var klart?

Hvordan kan vi forbedre det?

Takk for tilbakemeldingene dine!

close

Awesome!

Completion rate improved to 2.94

Sveip for å vise menyen

some-alt