傅里叶变不出的博客

转化为字符串处理 class Solution { public boolean isPalindrome(int x) { String num = Integer.toString(x); int len = num.length(); for (int i = 0; i < len/2; i++) { if (num.charAt(i) != num.charAt(len-i-1)) .

暴力求解 class Solution { public int[] twoSum(int[] nums, int target) { for (int i = 0; i < nums.length-1; i++) { for (int j = i+1; j < nums.length; j++) { if (nums[i] + nums[j] == target) { re.