private string DoDivision(string n, string d) { NumercStringUtils nsu = new NumercStringUtils(); int i = d.Length; string ni = n.Substring(0, i); if (!nsu.OneGreaterThanTwo(ni, d)) { ni = n.Substring(i, ++i); } for (int j = 1; j < 10; j++) { } if (nsu.OneGreaterThanTwo(n, d)) { //answer > 1 //if(n.Length - d.Length > 1) //{ Find} } else { //answer < 1 // lets deal with it later } return(""); }
private bool ReorderLargerFirst(ref IList <string> numbers) { bool negateAnswer = false; NumercStringUtils nsu = new NumercStringUtils(); if (numbers[0].Length < numbers[1].Length || !nsu.OneGreaterThanTwo(numbers[0], numbers[1])) { negateAnswer = true; // swap string t = numbers[0]; numbers[0] = numbers[1]; numbers[1] = t; } return(negateAnswer); }