• Homework_2


    一、错误代码:

    复制代码
    public int findLast (int[] x, int y) 
    { 
    //Effects: If x==null throw NullPointerException 
    // else return the index of the last element 
    // in x that equals y. 
    // If no such element exists, return -1 
    for (int i=x.length-1; i > 0; i--) 
    {
     if (x[i] == y)
     {
     return i;
     } 
    }
    return -1; 
    }
    // test: x=[2, 3, 5]; y = 2 
    // Expected = 0
    复制代码

    回答:

    1.检测不到x[0]

    2.令x = NULL

    3.x = [2,3]; y = 3

    4.x = [2,3]; y = 1

    二、错误代码

    复制代码
    public static int lastZero (int[] x) 
    {
     //Effects: if x==null throw NullPointerException
     // else return the index of the LAST 0 in x.
     // Return -1 if 0 does not occur in x
     for (int i = 0; i < x.length; i++) 
    {
      if (x[i] == 0)
     { 
    return i;
     } 
    }
     return -1; 
    }
    // test: x=[0, 1, 0] 
    // Expected = 2
    复制代码

    回答:

    1.要求返回最后一个零的位置,代码返回第一个零的位置

    2.x = NULL;

    3.x = [1,0];

    4.x = [0,1];

  • 相关阅读:
    (原)学以致用:用数学公式'幂函数'支持生产经营分析
    CString 成员函数用法大全
    致hr新人的一封信
    [恢]hdu 2560
    [恢]hdu 1907
    [恢]hdu 1267
    [恢]hdu 2554
    [恢]hdu 1329
    [恢]hdu 2317
    [恢]hdu 2555
  • 原文地址:https://www.cnblogs.com/aisingiorohanani/p/5254523.html
Copyright © 2020-2023  润新知