Write a function that when given a number >= 0, returns an Array of ascending length subarrays.

```
pyramid(0) => [ ]
pyramid(1) => [ [1] ]
pyramid(2) => [ [1], [1, 1] ]
pyramid(3) => [ [1], [1, 1], [1, 1, 1] ]
```

**Note:** the subarrays should be filled with `1`s

Source: codewars | Difficulty: EASY

Starter code: def pyramid(n):
	

Solutions:
def pyramid(n):
	return [[1] * x for x in range(1, n + 1)]


def pyramid(n):
	return [[1] * i for i in range(1, n + 1)]


def pyramid(n):
	result = []
	for i in range(1, n + 1):
		result.append(i * [1])
	return result


pyramid = lambda n: [-~i * [1] for i in range(n)]


def pyramid(n):
	res = []
	if n != 0:
		for i in range(1, n + 1):
			res.append([1 for x in range(i)])
	return res


def pyramid(n):
	A = list()
	for i in range(1, n + 1):
		a = list()
		for j in range(i):
			a.append(1)
		A.append(a)
	return A


pyramid = lambda __: [[1] * _ for _ in range(1, __ + 1)]


r = lambda i: -~i * [1]
pyramid = lambda n: [*map(r, range(n))]


def pyramid(n):
	pyramidArray = [[]] * n
	if n == 0:
		return []
	for i in range(0, n):
		l = [1] * int(i + 1)
		pyramidArray[i] = l
	return pyramidArray