Difficult:Medium

題目

Implement pow(x, n), which calculates x raised to the power n (i.e., xn).

Difficult:Medium

題目

You are given an n x n 2D matrix representing an image, rotate the image by 90 degrees (clockwise).

You have to rotate the image in-place, which means you have to modify the input 2D matrix directly. DO NOT allocate another 2D matrix and do the rotation.

Difficult:Medium

題目

Given a collection of numbers, nums, that might contain duplicates, return all possible unique permutations in any order.

Difficult:Medium

題目

Given an array nums of distinct integers, return all the possible permutations. You can return the answer in any order.

Difficult:Medium

題目

Given an array of non-negative integers nums, you are initially positioned at the first index of the array.

Each element in the array represents your maximum jump length at that position.

Your goal is to reach the last index in the minimum number of jumps.

You can assume that you can always reach the last index.