はてなブックマーク

Motivation A singly linked list is a common data structure familiar to all computer scientists. A singly linked list is made of nodes where each node has a pointer to the next node (or null to end the list). A singly linked list is often used as a stack (or last in first out queue (LIFO)) because adding a new first element, removing the existing first element, and examining the first element are v

A typical algorithm to correct snow would usually be something like this: Image correctSnow(Image image, int radiusOfSnow){ // Copy the image and convert the copy to black and white Image blackAndWhiteImage = threshold(copy(image), THRESHOLD_VALUE); // Copy the threshold and dilate and erode the copy Image dilatedAndEroded = erode( dilate( copy(blackAndWhiteImage), radiusOfSnow ), radiusOfSnow );