University of Arizona, Department of Computer Science

CSc 120: List Comprehensions 03

Expected Behavior

Write a Python function times_i(L) that takes as arguments a list L and returns a list consisting of the elements of L multiplied by the position number of the element. In other words, if L is the list
[L0, L1, L2, ..., Ln]
then the value returned by times_i(L) is the list
[L0 × 0, L1 × 1, L2 × 2, ..., Ln × n]

Your solution should use list comprehensions only. It should not use any other control statements—i.e., no if, for, while, or try statements, except as needed within the list comprehension.

Examples

  1. Call: times_i([11,22,33,44,55])
    Result: [0, 22, 66, 132, 220]

  2. Call: times_i([0,100,90,80,70,60,50,40,30,20,10])
    Result: [0, 100, 180, 240, 280, 300, 300, 280, 240, 180, 100]

  3. Call: times_i([])
    Result: []