C#练习题答案: 这些是不是你要找的数字！ （查找数由近似）【难度：2级】--景越C#经典编程题库,1000道C#基础练习题等你来挑战

这些是不是你要找的数字! (查找数由近似)【难度:2级】:

答案1:

using System;

public class Kata
{
  public static double FindNumber(Func<double,int> compare)
  {
        double p = 50.0, ma = 100.0, mi = 0.0, d = 100.0;
        while((ma-mi)>0.00002) {
            int r = compare(p); 
            if(r<0) {
                mi = p;
                p = (p + ma)/2;
            } else if(r>0) {
                ma = p;
                p = (p + mi)/2;
            } else {
                return(p);
            }
        }
        return(p);
  }
}​

答案2:

using System;
   public class Kata
    {
        public static double FindNumber(Func<double, int> compare)
        {
            double a = 50.0;
            while(true)
            {
                if (compare(a) == -1)
                {
                    a += 0.00001;
                    if (compare(a) == 1) break;
                }
                else if (compare(a) == 1)
                {
                    a -= 0.00001;
                    if (compare(a) == -1) break;
                }
                else break;
            }
            return a;
        }
    }​

答案3:

using System;

public class Kata
{
  protected static double GetMidle (double max, double min)
  {
    return (max + min) / 2;
  }

  public static double FindNumber(Func<double,int> compare)
  {
    double max = 100;
    double min = 0;
    double epsilo = 0.000001;
    double count = GetMidle(max, min);
    double last_count = 0;
    
    
    while (compare(count) != 0)
    {
      if (compare(count) > 0) { max = count; }
      if (compare(count) < 0) { min = count; }
      last_count = count;
      count = GetMidle(max, min);
      if (System.Math.Abs(count - last_count) < epsilo) { break; }
    }
    
    
    
    
    return count;
  }
}​

答案4:

using System;

public class Kata {

    public static double FindNumber( Func<double, int> compare ) {
        double n = 0;
        while ( true ) {
            if ( compare( n ) == 0 ) {
                return n;
            }
            if ( compare( n ) == -1 ) {
                n += 1;
            }
            else {
                n -= 1;
                break;
            }
        }
        var d = 0.5;
        do {
            n += d;
            if ( compare( n ) == 0 ) {
                return n;
            }
            if ( compare( n ) == 1 ) {
                n -= d;
            }
            d /= 2;

        } while ( true );
    }


}​

答案5:

using System;

public class Kata
{
    public static double FindNumber(Func<double, int> compare)
    {
        double intervalStart = 0.0;
        double intervalEnd = 100.0;
        double half = (intervalEnd + intervalStart) / 2.0;
        int result = compare(half);
        while(result != 0)
        {
            if (result > 0)
                intervalEnd = half;
            else
                intervalStart = half;
            half = (intervalEnd + intervalStart) / 2.0;
            result = compare(half);
        }
        return half;
    }
}​

答案6:

using System;

public class Kata
{
  public static double FindNumber(Func<double,int> compare, double min = 0, double max = 100)
  {
      var guess = Math.Round((min + max) / 2, 5);
      var comp = compare(guess);
      if(comp == 0 || max-min < .00002)
        return guess;
      else if(comp == -1)
        return FindNumber(compare, guess, max);
      else
        return FindNumber(compare, min, guess);
  }
}​

答案7:

using System;

public class Kata
{
  public static double FindNumber(Func<double,int> compare)
  {
    var lower = 0d;
    var higher = 100d;
    double middle; 
    
    do
    {
      middle = Math.Round((lower + higher) / 2, 5);
      var result = compare(middle);
      
      if(result == 0)
        return middle;
      
      else if(result == -1)
        lower = middle;
      
      else
        higher = middle;
        
    } while(higher-lower >= 0.00002);
    
    return middle;
  }
}​

答案8:

using System;

public class Kata
{
        public static double FindNumber(Func<double, int> compare)
        {
            var begin = 0d;
            var end = 100d;
            while(true)
            {
                var m = (end + begin) / 2;
                if (end - begin <= 0.00002) return m;
                var r = compare(m);
                if (r < 0) begin = m;
                if (r > 0) end = m;
                if (r == 0) return m;
            }
        }
}​

答案9:

using System;

public class Kata
{
  public static double FindNumber(Func<double,int> compare)
  {
    double upper = 100, lower = 0, guess;
    int compareVal;
    
    while (upper - lower > .00002)
    {
      guess = (upper + lower) / 2;
      compareVal = compare(guess);
      if(compareVal == 0)
        return guess;
      else if(compareVal < 0)
        lower = guess;
      else
        upper = guess;
    }
    
    return (upper + lower) / 2;
  }
}​

答案10:

using System;

public class Kata
{
    public static double FindNumber(Func<double, int> compare)
    {
        double max = 100;
        double min = 0;

        int compareResult = 0;
        double attempt = 0;
        do
        {
            attempt = min + (max - min) / 2;
            compareResult = compare(attempt);
            if (compareResult < 0)
                min = attempt;
            else if (compareResult > 0)
                max = attempt;
        } while (compareResult != 0);

        return attempt;
    }
}​