Description

Given a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent.

A mapping of digit to letters (just like on the telephone buttons) is given below. Note that 1 does not map to any letters.

Example:

1
2

Input: "23"
Output: ["ad", "ae", "af", "bd", "be", "bf", "cd", "ce", "cf"].

Note:

Although the above answer is in lexicographical order, your answer could be in any order you want.

Difficulty: Medium

Code:

1
2
3
4
5

class Solution {
    public List<String> letterCombinations(String digits) {
        
    }
}

题意

给定一个包含数字2-9的字符串，返回数字代表的所有可能的字符组合。数字和字母的映射和电话按钮一样。

Description

Given an array nums of n integers and an integer target, find three integers in nums such that the sum is closest to target. Return the sum of the three integers. You may assume that each input would have exactly one solution.

Example:

1
2
3

Given array nums = [-1, 2, 1, -4], and target = 1.

The sum that is closest to the target is 2. (-1 + 2 + 1 = 2).

Difficulty: Medium

Code:

1
2
3
4
5

class Solution {
    public int threeSumClosest(int[] nums, int target) {
        
    }
}

题意

给定n个整数和一个目标整数，找出三个整数，其和和目标整数最接近。

Description

Given an array nums of n integers, are there elements a, b, c in nums such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.

Note:

The solution set must not contain duplicate triplets.

Example:

1
2
3
4
5
6
7

Given array nums = [-1, 0, 1, 2, -1, -4],

A solution set is:
[
  [-1, 0, 1],
  [-1, -1, 2]
]

Difficulty: Medium

Code:

1
2
3
4
5

class Solution {
    public List<List<Integer>> threeSum(int[] nums) {
        
    }
}

题意

给定n个整数，求所有三个数字组合使得它们之和为0，数字组合不能重复。

Description

Write a function to find the longest common prefix string amongst an array of strings.

If there is no common prefix, return an empty string “”.

Example 1:

1
2

Input: ["flower","flow","flight"]
Output: "fl"

Example 2:

1
2
3

Input: ["dog","racecar","car"]
Output: ""
Explanation: There is no common prefix among the input strings.

Note:

All given inputs are in lowercase letters a-z.

Difficulty: Easy

Code:

1
2
3
4
5

class Solution {
    public String longestCommonPrefix(String[] strs) {
        
    }
}

题意

在字符串数组中找出最长的公共前缀字符串，若没有则返回空字符串。

Description

Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M.

1
2
3
4
5
6
7
8

Symbol       Value
I             1
V             5
X             10
L             50
C             100
D             500
M             1000

For example, two is written as II in Roman numeral, just two one’s added together. Twelve is written as, XII, which is simply X + II. The number twenty seven is written as XXVII, which is XX + V + II.

Roman numerals are usually written largest to smallest from left to right. However, the numeral for four is not IIII. Instead, the number four is written as IV. Because the one is before the five we subtract it making four. The same principle applies to the number nine, which is written as IX. There are six instances where subtraction is used:

• I can be placed before V (5) and X (10) to make 4 and 9.
• X can be placed before L (50) and C (100) to make 40 and 90.
• C can be placed before D (500) and M (1000) to make 400 and 900.

Given a roman numeral, convert it to an integer. Input is guaranteed to be within the range from 1 to 3999.

Example 1:

1
2

Input: "III"
Output: 3

Example 2:

1
2

Input: "IV"
Output: 4

Example 3:

1
2

Input: "IX"
Output: 9

Example 4:

1
2
3

Input: "LVIII"
Output: 58
Explanation: L = 50, V= 5, III = 3.

Example 5:

1
2
3

Input: "MCMXCIV"
Output: 1994
Explanation: M = 1000, CM = 900, XC = 90 and IV = 4.

Difficulty: Easy

Code:

1
2
3
4
5

class Solution {
    public int romanToInt(String s) {
        
    }
}

题意

将罗马数字转成整数，假定此整数范围在1到3999。