leetcode 高频面试题

``` class Solution { // 每个位置的数都不一样， public static int search(int[] nums, int target) { if (nums == n

![image.png](https://p9-juejin.byteimg.com/tos-cn-i-k3u1fbpfcp/1595fe91a42b45e982d334ca0d0517e8~tplv

![image.png](https://p3-juejin.byteimg.com/tos-cn-i-k3u1fbpfcp/70cd031fc9294a7c904825963981fe87~tplv

``` import java.util.ArrayList; import java.util.List; public class Leetcode_0017_LetterCombinations

``` import java.util.ArrayList; import java.util.Arrays; import java.util.List; public class Leetcod

``` public class Leetcode_0014_LongestCommonPrefix { public static String longestCommonPrefix(String

``` /** * 13. 罗马数字转整数 简单 **/ public class Leetcode_0013_RomanToInteger { public static int romanToIn

``` /** * 12. 整数转罗马数字 简单 **/ public class Leetcode_0012_IntegerToRoman { public static String intToR

``` /** * 5. 最长回文子串 中等 **/ public class Leetcode_0005_LongestPalindromicSubstring { public static St

``` /** * 4. 寻找两个正序数组的中位数 困难 **/ public class Leetcode_0004_MedianOfTwoSortedArrays { public static

``` public class Leetcode_0002_AddTwoNumbers { public static class ListNode { int val; ListNode next

``` public class Leetcode_0001_TwoSum { public static int[] twoSum(int[] arr, int target) { if (arr

``` /** * 首尾分别 2 个指针，每次移动以后都分别判断长宽的乘积是否最大。 */ public static int maxArea(int[] height) { if (height =

``` public static int reverse(int x) { // x < 0 ? boolean isLtZero = (x >>> 31 & 1) == 1;```