Updated 103-infinite_add.c

Author: ahmaddev-codes

0x06-pointers_arrays_strings/103-infinite_add.c

@@ -1,61 +1,78 @@
 #include "main.h"
 
 /**
- * infinite_add - adds two numbers
- *
- * @n1: first number
- * @n2: second number
- * @r: buffer for result
- * @size_r: buffer size
- *
- * Return: address of r or 0
+ * rev_string - reverse array
+ * @n: integer params
+ * Return: 0
  */
 
-char *infinite_add(char *n1, char *n2, char *r, int size_r)
+void rev_string(char *n)
 {
-	int i, j, k, l, m, n;
-	for (i = 0; n1[i]; i++)
-		;
-	
-	for (j = 0; n2[j]; j++)
-		;
-	
-	if (i > size_r || j > size_r)
-		return (0);
-	
-	m = 0;
-	
-	for (i -= 1, j -= 1, k = 0; k < size_r - 1; i--, j--, k++)
+	int i = 0;
+	int j = 0;
+	char temp;
+
+	while (*(n + i) != '\0')
 	{
-		n = m;
-		
-		if (i >= 0)
-			n += n1[i] - '0';
-		
-		if (j >= 0)
-			n += n2[j] - '0';
-		
-		if (i < 0 && j < 0 && n == 0)
-		{
-			break;
-		}
-		
-		m = n / 10;
-		r[k] = n % 10 + '0';
-	
+		i++;
 	}
-	
-	r[k] = '\0';
-	
-	if (i >= 0 || j >= 0 || m)
-		return (0);
+	i--;
 
-	for (k -= 1, l = 0; l < k; k--, l++)
+	for (j = 0; j < i; j++, i--)
 	{
-		m = r[k];
-		r[k] = r[l];
-		r[l] = m;
+		temp = *(n + j);
+		*(n + j) = *(n + i);
+		*(n + i) = temp;
 	}
+}
 
+/**
+ * infinite_add - add 2 numbers together
+ * @n1: text representation of 1st number to add
+ * @n2: text representation of 2nd number to add
+ * @r: pointer to buffer
+ * @size_r: buffer size
+ * Return: pointer to calling function
+ */
+
+char *infinite_add(char *n1, char *n2, char *r, int size_r)
+{
+	int overflow = 0, i = 0, j = 0, digits = 0;
+	int val1 = 0, val2 = 0, temp_tot = 0;
+
+	while (*(n1 + i) != '\0')
+		i++;
+	while (*(n2 + j) != '\0')
+		j++;
+	i--;
+	j--;
+	if (j >= size_r || i >= size_r)
+		return (0);
+	while (j >= 0 || i >= 0 || overflow == 1)
+	{
+		if (i < 0)
+			val1 = 0;
+		else
+			val1 = *(n1 + i) - '0';
+		if (j < 0)
+			val2 = 0;
+		else
+			val2 = *(n2 + j) - '0';
+		temp_tot = val1 + val2 + overflow;
+		if (temp_tot >= 10)
+			overflow = 1;
+		else
+			overflow = 0;
+		if (digits >= (size_r - 1))
+			return (0);
+		*(r + digits) = (temp_tot % 10) + '0';
+		digits++;
+		j--;
+		i--;
+	}
+	if (digits == size_r)
+		return (0);
+	*(r + digits) = '\0';
+	rev_string(r);
 	return (r);
 }