#include "c-hash-map.h" #include "c-array.h" #include "c-mem.h" #include "c-str.h" #include <stdlib.h> #include <stdio.h> typedef struct { CHashMap* capacities; } Order; Order* order_new () { Order* order = c_malloc (sizeof (Order)); order->capacities = c_hash_map_new (c_str_hash, (CEqualFunc) c_str_equal, nullptr, nullptr); return order; } void order_free (Order* order) { c_hash_map_free (order->capacities); free (order); } void order_recv (Order* order, char* capacity, int quantity) { if (c_hash_map_contains (order->capacities, capacity)) { int value; value = (int) (intptr_t) c_hash_map_lookup (order->capacities, capacity); c_hash_map_insert (order->capacities, capacity, C_INT_TO_VOIDP (value + quantity)); } else { c_hash_map_insert (order->capacities, capacity, C_INT_TO_VOIDP (quantity)); } } void order_print_capacities_info (Order* order) { CArray* list_of_2_or_more_items = c_array_new (nullptr, true); puts ("----------------------------"); CHashMapIter iter; char* capacity; void* value; c_hash_map_iter_init (&iter, order->capacities); while (c_hash_map_iter_next (&iter, (void**) &capacity, (void**) &value)) { int quantity = C_VOIDP_TO_INT (value); printf ("%s:\t %d\n", capacity, quantity); if (quantity > 1) c_array_add (list_of_2_or_more_items, capacity); } puts ("----------------------------"); puts ("List of 2 or more items"); for (int i = 0; i < list_of_2_or_more_items->len; i++) puts (list_of_2_or_more_items->data[i]); c_array_free (list_of_2_or_more_items); } int main () { char* order_capacity[] = { "355ml", "355ml", "750", "1000ml", "8oz", "8oz", "100ml" }; int order_quantity[] = { 1, 2, 100, 10, 1, 3, 1 }; Order* order = order_new (); for (int i = 0; i < C_N_ELEMENTS (order_capacity); i++) { order_recv (order, order_capacity[i], order_quantity[i]); } order_print_capacities_info (order); order_free (order); return 0; }

---------------------------- 355ml: 3 750: 100 1000ml: 10 8oz: 4 100ml: 1 ---------------------------- List of 2 or more items 355ml 750 1000ml 8oz

C 언어로 해도 쉽죠.

다만, 타이핑 시간이 더 걸린다는 점.