摘要：
题目 You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping 阅读全文
摘要：
题目 You are climbing a staircase. It takes n steps to reach the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you cli 阅读全文
摘要：
题目 Given a string s, you can transform every letter individually to be lowercase or uppercase to create another string. Return a list of all possible 阅读全文
摘要：
题目 Given an array nums of distinct integers, return all the possible permutations. You can return the answer in any order. Example 1: Input: nums = [1 阅读全文