0x03-python-data_structures

Author: IamNaeto

0x03-python-data_structures/0-print_list_integer.py

@@ -0,0 +1,4 @@
+#!/usr/bin/python3
+def print_list_integer(my_list=[]):
+ for i in range(len(my_list)):
+ print("{:d}".format(my_list[i]))

0x03-python-data_structures/1-element_at.py

@@ -0,0 +1,6 @@
+#!/usr/bin/python3
+
+def element_at(my_list, idx):
+ if (idx < 0) or (idx > len(my_list) - 1):
+ return None
+ return(my_list[idx])

0x03-python-data_structures/10-divisible_by_2.py

@@ -0,0 +1,13 @@
+#!/usr/bin/python3
+
+
+def divisible_by_2(my_list=[]):
+ """Find all multiples of 2 in a list."""
+ multiples = []
+ for i in range(len(my_list)):
+ if my_list[i] % 2 == 0:
+ multiples.append(True)
+ else:
+ multiples.append(False)
+
+ return (multiples)

0x03-python-data_structures/100-print_python_list_info.c

@@ -0,0 +1,25 @@
+#include <Python.h>
+
+/**
+ * print_python_list_info - Prints basic info about Python lists.
+ * @p: A PyObject list.
+ */
+void print_python_list_info(PyObject *p)
+{
+int size, alloc, i;
+PyObject *obj;
+
+size = Py_SIZE(p);
+alloc = ((PyListObject *)p)->allocated;
+
+printf("[*] Size of the Python List = %d\n", size);
+printf("[*] Allocated = %d\n", alloc);
+
+for (i = 0; i < size; i++)
+{
+printf("Element %d: ", i);
+
+obj = PyList_GetItem(p, i);
+printf("%s\n", Py_TYPE(obj)->tp_name);
+}
+}

0x03-python-data_structures/11-delete_at.py

@@ -0,0 +1,8 @@
+#!/usr/bin/python3
+
+
+def delete_at(my_list=[], idx=0):
+ """Delete an item at a specific position in a list."""
+ if idx >= 0 and idx < len(my_list):
+ del my_list[idx]
+ return (my_list)

0x03-python-data_structures/12-switch.py

@@ -0,0 +1,5 @@
+#!/usr/bin/python3
+a = 89
+b = 10
+a, b = b, a
+print("a={:d} - b={:d}".format(a, b))

0x03-python-data_structures/13-is_palindrome.c

@@ -0,0 +1,72 @@
+#include "lists.h"
+
+listint_t *reverse_listint(listint_t **head);
+int is_palindrome(listint_t **head);
+
+/**
+ * reverse_listint - Reverses a singly-linked listint_t list.
+ * @head: A pointer to the starting node of the list to reverse.
+ *
+ * Return: A pointer to the head of the reversed list.
+ */
+listint_t *reverse_listint(listint_t **head)
+{
+listint_t *node = *head, *next, *prev = NULL;
+
+while (node)
+{
+next = node->next;
+node->next = prev;
+prev = node;
+node = next;
+}
+
+*head = prev;
+return (*head);
+}
+
+/**
+ * is_palindrome - Checks if a singly linked list is a palindrome.
+ * @head: A pointer to the head of the linked list.
+ *
+ * Return: If the linked list is not a palindrome - 0.
+ * If the linked list is a palindrome - 1.
+ */
+int is_palindrome(listint_t **head)
+{
+listint_t *tmp, *rev, *mid;
+size_t size = 0, i;
+
+if (*head == NULL || (*head)->next == NULL)
+return (1);
+
+tmp = *head;
+while (tmp)
+{
+size++;
+tmp = tmp->next;
+}
+
+tmp = *head;
+for (i = 0; i < (size / 2) - 1; i++)
+tmp = tmp->next;
+
+if ((size % 2) == 0 && tmp->n != tmp->next->n)
+return (0);
+
+tmp = tmp->next->next;
+rev = reverse_listint(&tmp);
+mid = rev;
+
+tmp = *head;
+while (rev)
+{
+if (tmp->n != rev->n)
+return (0);
+tmp = tmp->next;
+rev = rev->next;
+}
+reverse_listint(&mid);
+
+return (1);
+}

0x03-python-data_structures/2-replace_in_list.py

@@ -0,0 +1,9 @@
+#!/usr/bin/python3
+
+
+def replace_in_list(my_list, idx, element):
+ if (idx < 0) or (idx > len(my_list) - 1):
+ return my_list
+ else:
+ my_list[idx] = element
+ return my_list

0x03-python-data_structures/3-print_reversed_list_integer.py

@@ -0,0 +1,8 @@
+#!/usr/bin/python3
+
+
+def print_reversed_list_integer(my_list=[]):
+ if isinstance(my_list, list):
+ my_list.reverse()
+ for i in my_list:
+ print("{:d}".format(i))

0x03-python-data_structures/4-new_in_list.py

@@ -0,0 +1,7 @@
+#!/usr/bin/python3
+def new_in_list(my_list, idx, element):
+ if (idx < 0 or len(my_list) <= idx):
+ return my_list
+ newList = my_list[:]
+ newList[idx] = element
+ return newList