java - 重构我的数组排序函数

Question

那么，如何让它更紧凑呢？

   public static boolean isDirectOrder( int[] data )
   {
      boolean answer = true;

      if ( ( data != null ) && ( data.length > 1 ) )
      {
         int last = data[0];

         for (int i = 0; i < data.length; i++)
         {
            if ( last <= data[i] )
            {
               last = data[i];
            }
            else
            {
               answer = false;
               break;
            }
         }
      }

      return answer;
   }

也许存在用于相同检查的标准工具？

Answer 1

public static boolean isDirectOrder( int[] data )
{
    if (data != null)
        for (int i = 1; i < data.length; i++)
            if (data[i] < data[i - 1])
                return false;

    return true;
}