题目如图,下面是我的解决方法: class Solution { public boolean isPalindrome(int x) { if(x < 0) //由题意可知,小于0的数不可能为回数, 因此直接返回false 4 return false; else { String len = x + ""; int[] arr = new int[len.length()]; //创建数组arr, 长度为x的位数 int result = 0; int q = x; for(…

Description Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array. Note: The number of elements initialized in nums1 and nums2 are m and n respectively. You may assume that nums1 has enough space (size that is gr…

Description Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order. You may assume no duplicates in the array. Example 1: Input: [,,,], Output: Example…

492. Construct the Rectangle Input: 4 Output: [2, 2] Explanation: The target area is 4, and all the possible ways to construct it are [1,4], [2,2], [4,1]. But according to requirement 2, [1,4] is illegal; according to requirement 3, [4,1] is not opti…

1.Two Sum Given an array of integers, return indices of the two numbers such that they add up to a specific target. You may assume that each input would have exactly one solution, and you may not use the same element twice. Example: Given nums = [2,…

7.Reverse Integer Given a 32-bit signed integer, reverse digits of an integer. Example 1: Input: Output: Example 2: Input: - Output: - Example 3: Input: Output: Note:Assume we are dealing with an environment which could only hold integers within the…

1.Two Sum Given an array of integers, return indices of the two numbers such that they add up to a specific target. You may assume that each input would have exactly one solution, and you may not use the same element twice. Example: Given nums = [2,…

Description Given a binary array, find the maximum number of consecutive 1s in this array. Example 1: Input: [,,,,,] Output: Explanation: The first two digits or the last three digits are consecutive 1s. The maximum number of consecutive 1s . Note: T…

Description Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once. Find all the elements of [1, n] inclusive that do not appear in this array. Could you do it without extra space and in O…

Description Given a non-empty array of integers, return the third maximum number in this array. If it does not exist, return the maximum number. The time complexity must be in O(n). Example 1: Input: [, , ] Output: Explanation: The third maximum .  E…