public class DailyTemperatures { /* 解法一:暴力 */ public int[] dailyTemperatures(int[] T) { int[] result=new int[T.length]; for (int i=0;i<T.length;i++){ for (int j=i+1;j<T.length;j++){ if (T[j]>T[i]){ result[i]=j-i; break; } } } returnResult; } / * Solution two: forward traversal from the reduced number of inner traversal. * / Public int [] dailyTemperatures2 ( int [] T) { int length = T.length; int [] = Result new new int [length]; for ( int I = length-2; I> = 0; i-- ) { for ( int J = I +. 1; J <length-. 1; J + = Result [J]) { IF (T [I] < T [J]) { Result [I] = J- I; BREAK ; } the else if (T[i]>T[j]){ result[i]=0; } } } return result; } }