James Pan

原题网址：https://leetcode.com/problems/3sum-smaller/ Given an array of n integers nums and a target, find the number of index triplets i, j, k with 0  that satisfy the condition nums[i] + nums[j]

原题网址：https://leetcode.com/problems/climbing-stairs/ You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In how many distinct ways

原题网址：https://leetcode.com/problems/decode-ways/ A message containing letters from A-Z is being encoded to numbers using the following mapping: 'A' -> 1 'B' -> 2 ... 'Z' -> 26 Given an enco