From 6af142009cab382b69f4e36c9bc756580d326d0e Mon Sep 17 00:00:00 2001
From: =?utf8?q?Luk=C3=A1=C5=A1=20Ji=C5=99i=C5=A1t=C4=9B?=
 <gymnazium.jiriste@gmail.com>
Date: Thu, 7 Dec 2023 10:28:31 +0100
Subject: [PATCH] Update Libft. Add solution to first part of day 7

Update Libft to include patch, that repairs sorted insert into list.
---
 7/7.c | 231 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
 Libft |   2 +-
 2 files changed, 232 insertions(+), 1 deletion(-)
 create mode 100644 7/7.c

diff --git a/7/7.c b/7/7.c
new file mode 100644
index 0000000..ad9374f
--- /dev/null
+++ b/7/7.c
@@ -0,0 +1,231 @@
+
+#include <stdlib.h>
+#include <unistd.h>
+#include <fcntl.h>
+#include "libft.h"
+
+#define HAND_SIZE 5
+
+enum e_card
+{
+	two,
+	three,
+	four,
+	five,
+	six,
+	seven,
+	eight,
+	nine,
+	ten,
+	jack,
+	queen,
+	king,
+	ace,
+	unknown,
+};
+typedef enum e_card	t_card;
+
+enum e_type
+{
+	high_card,
+	one_pair,
+	two_pair,
+	three_ok,
+	full_house,
+	four_ok,
+	five_ok,
+};
+typedef enum e_type	t_type;
+
+struct s_hand
+{
+	t_card	cards[5];
+	int			bid;
+};
+typedef struct s_hand	t_hand;
+
+t_card	c_to_card(char c)
+{
+	if (ft_isdigit(c))
+		return (c - '2');
+	if (c == 'T')
+		return (ten);
+	if (c == 'J')
+		return (jack);
+	if (c == 'Q')
+		return (queen);
+	if (c == 'K')
+		return (king);
+	if (c == 'A')
+		return (ace);
+	return (unknown);
+}
+
+t_hand	*parse(const char *str)
+{
+	t_hand	*hand;
+	size_t	i;
+
+	i = 0;
+	hand = malloc(sizeof(t_hand));
+	if (!hand)
+		return (hand);
+	while (i < HAND_SIZE)
+	{
+		hand->cards[i] = c_to_card(str[i]);
+		++i;
+	}
+	hand->bid = ft_atoi(str + HAND_SIZE);
+	return (hand);
+}
+
+t_type	counts_to_type(size_t counts[5])
+{
+	size_t	i;
+	size_t	max;
+
+	i = 0;
+	max = 0;
+	while (i < HAND_SIZE)
+	{
+		if (max < counts[i])
+			max = counts[i];
+		++i;
+	}
+	if (max == 5)
+		return (five_ok);
+	if (max == 4)
+		return (four_ok);
+	i = 0;
+	if (max == 3)
+	{
+		while (i < HAND_SIZE)
+			if (counts[i++] == 2)
+				return (full_house);
+		return (three_ok);
+	}
+	if (max == 2)
+	{
+		while (i < HAND_SIZE)
+			if (counts[i++] == 2)
+				while (i < HAND_SIZE)
+					if (counts[i++] == 2)
+						return (two_pair);
+		return (one_pair);
+	}
+	return (high_card);
+}
+
+t_type	type(t_hand *hand)
+{
+	t_card	cards[HAND_SIZE];
+	size_t	counts[HAND_SIZE];
+	size_t	i;
+	size_t	j;
+
+	i = 0;
+	while (i < HAND_SIZE)
+	{
+		cards[i] = unknown;
+		counts[i] = 0;
+		++i;
+	}
+	i = 0;
+	while (i < HAND_SIZE)
+	{
+		j = 0;
+		while (j < HAND_SIZE)
+		{
+			if (hand->cards[i] == cards[j] || cards[j] == unknown)
+			{
+				cards[j] = hand->cards[i];
+				++counts[j];
+				break;
+			}
+			++j;
+		}
+		++i;
+	}
+	return (counts_to_type(counts));
+}
+
+int	compare_hand(t_hand *first, t_hand *second)
+{
+	size_t	i;
+
+	if (type(first) != type(second))
+		return (type(first) - type(second));
+	i = 0;
+	while (first->cards[i] == second->cards[i])
+		++i;
+	return (first->cards[i] - second->cards[i]);
+}
+
+void	hand_to_str(char *str, t_hand *hand)
+{
+	size_t	i;
+	char	c;
+
+	i = 0;
+	while (i < HAND_SIZE)
+	{
+		c = '2';
+		while (c < 'Z')
+		{
+			if (c_to_card(c) == hand->cards[i])
+			{
+				str[i] = c;
+				break;
+			}
+			++c;
+		}
+		++i;
+	}
+	return ;
+}
+
+int	total_winnings(t_list *games)
+{
+	size_t	rank;
+	int		result;
+	char	str[5];
+
+	rank = 1;
+	result = 0;
+	while (games)
+	{
+		hand_to_str(str, games->content);
+		ft_printf("Hand %.5s has rank %u, bid %i and type %i.\n", str, rank, ((t_hand *)(games->content))->bid, type((t_hand *)(games->content)));
+		result += rank * ((t_hand *)(games->content))->bid;
+		games = games->next;
+		++rank;
+	}
+	return (result);
+}
+
+int	main(int argc, char **argv)
+{
+	int		fd;
+	t_list	*list;
+	t_list	*new;
+	char	*line;
+
+	fd = open(argv[1], O_RDONLY);
+	if (fd < 0)
+		return (2);
+	line = get_next_line(fd);
+	list = NULL;
+	while (line)
+	{
+		new = ft_lstnew(parse(line));
+		if (!new)
+			return (3);
+		ft_lst_sorted_insert(&list, new, compare_hand);
+		free(line);
+		line = get_next_line(fd);
+	}
+	ft_printf("The total winnings are %i.\n", total_winnings(list));
+	close(fd);
+	ft_lstclear(&list, free);
+	return (0);
+}
diff --git a/Libft b/Libft
index 979c7ee..f442633 160000
--- a/Libft
+++ b/Libft
@@ -1 +1 @@
-Subproject commit 979c7eed8d16d89f0a0241d6124a89ea39f2ad94
+Subproject commit f4426331a51ca886a93bf4d31f8bad21c672d2e5
-- 
2.30.2