w120459474的专栏

/*1.正整数2.12321,121,122221长度为奇、偶数位，翻转后与原值一致；*/ public static boolean isPalindrome(int x) { int rev = 0; if (x < 0 || (x % 10 == 0 && x != 0)) return false; while (x > rev) { rev = rev * 1

在这里插入代码片class Solution { public int reverse(int x) { int ori = 0; int temp = 0; if(x == 0) return x; //不等于0正负数均整数逆转 while(x!=0){ //取余取末位 int pop = x%10; //判断是否溢出

class Solution {public int[] twoSum(int[] nums, int target) {HashMap<Integer,Integer> numMap= new HashMap(); for(int i = 0;i<nums.length;i++) { if(numMap.containsKey(target-nums[i])) { return new int[] {numMap

给定元素，计算元素组合import java.util.Arrays;public class Main { public static void main(String[] args) { select(2); select(3); select(4); select(5); } public static void select(int k){ int[] result = new int.