Merge pull request #1 from kennyledet/master

rvsp · web-flow · commit 18ee106b4fd6 · 2021-01-05T23:13:06.000+05:30
changes
diff --git a/Decimal_To_Fraction/Python/ivanchoff/decimalToFraction.py b/Decimal_To_Fraction/Python/ivanchoff/decimalToFraction.py
@@ -0,0 +1,21 @@
+# Module that cast a decimal number to fraction notation
+# Input:
+#    number: number to cast
+# return:
+#    tuple[0]: is the error, None is returned when the process has no error
+#              otherwise a string with message of error is returned
+#    tuple[1]: is number in fraction notation
+
+
+from fractions import Fraction
+
+def decimalToFraction(number):
+    if(isinstance(number,(int,float))):
+        ans = Fraction(number).limit_denominator()
+        return (None,str(ans))
+    else:
+        return ('error','arg must be number')
+
+if __name__ == '__main__':
+    print(decimalToFraction(3.45))
+
diff --git a/Decimal_To_Fraction/Python/ivanchoff/decimalToFraction_test.py b/Decimal_To_Fraction/Python/ivanchoff/decimalToFraction_test.py
@@ -0,0 +1,12 @@
+from decimalToFraction import decimalToFraction
+
+test_input = [2.34, 2.45, "hola", "mundo", 3.90]
+test_output_err = [None, None, 'error', 'error', None]
+
+for number, error  in zip(test_input,test_output_err):
+    ans = decimalToFraction(number)
+    if(ans[0] != error):
+        print('the code is wrong!!')
+    else:
+        print(number,' -> ',ans[1])
+    
diff --git a/Levenshtein_distance/Lua/Yonaba/levenshtein.lua b/Levenshtein_distance/Lua/Yonaba/levenshtein.lua
@@ -4,11 +4,6 @@
 -- Iterative matrix-based method
 -- See: http://en.wikipedia.org/wiki/Levenshtein_distance#Iterative_with_full_matrix
 
--- Return the minimum of three elements
-local function min(a, b, c)
-	return math.min(math.min(a, b), c)
-end
-
 -- Creates a 2D matrix
 local function matrix(row,col)
   local m = {}
@@ -30,7 +25,7 @@ local function lev_iter_based(strA,strB)
       if (strA:sub(i-1,i-1) == strB:sub(j-1,j-1)) then cost = 0
       else cost = 1
       end
-    M[i][j] = min(M[i-1][j]+1,M[i][j-1]+1,M[i-1][j-1]+cost)
+    M[i][j] = math.min(M[i-1][j]+1,M[i][j-1]+1,M[i-1][j-1]+cost)
     end
   end
   return M[row][col]
@@ -45,7 +40,7 @@ local function lev_recursive_based(strA, strB, s, t)
   if s == 0 then return t end
   if t == 0 then return s end
   local cost = strA:sub(s,s) == strB:sub(t,t) and 0 or 1
-  return min(
+  return math.min(
     lev_recursive_based(strA, strB, s - 1, t) + 1,
     lev_recursive_based(strA, strB, s, t - 1) + 1,
     lev_recursive_based(strA, strB, s - 1, t - 1) + cost
diff --git a/Palindrome/ruby/ivanchoff/palindrome.rb b/Palindrome/ruby/ivanchoff/palindrome.rb
@@ -0,0 +1,9 @@
+# function that check if a string is palindrome (case sensitive)
+# input:
+#   str: word to check
+# return:
+#   true or false
+
+def palindrome?(str)
+  str == str.reverse
+end
diff --git a/Palindrome/ruby/ivanchoff/palindrome_test.rb b/Palindrome/ruby/ivanchoff/palindrome_test.rb
@@ -0,0 +1,25 @@
+require "./palindrome"
+
+begin
+  # raises an ArgumentError with the message "you messed up!"
+  if palindrome?("hola") == true
+    raise ArgumentError.new("The code for palindrome is wrong!")
+  else
+    print("hola is no-palindrome\n")
+  end
+  
+  if palindrome?("ala") == false
+    raise ArgumentError.new("The code for palindrome is wrong!")
+  else
+    print("ala is palindrome\n")
+  end
+  
+  if palindrome?("radar") == false
+    raise ArgumentError.new("The code for palindrome is wrong!")
+  else
+    print("radar is palindrome\n")
+  end
+  
+  rescue ArgumentError => e  
+    puts e.message
+end
