jasonworld的专栏

此题目验证算法存在问题，因为timu

思路：将数组bianli

public int reverse(int x){ int ans = 0; int flag = 1; if(x < 0){ flag = -1; x = -x; } String str = Integer.toString(x); char [] charArray = str.toCharArray(); for(int i = charArray

public String convert(String s, int nRows) { String finalString = ""; char []array = s.toCharArray(); if(nRows == 1){ return s; } String []string = new Strin

public int maxSubArray(int[] A) { int ans = A[0]; int max = 0; for (int i = 0; i < A.length; i++) { max += A[i]; if(max > ans) ans = max; if(max < 0)

public boolean isPalindrome(int x) { if(x < 0){ return false; } if(x < 10){ return true; } String string = Integer.toString(x); char []array = string.toCharArray(); int length = ar