Brute Force Searching strategy is a useful problem-solving approach that systematically enumerates all possible candidates for the solution and then selecting the proper candidates as the result set.
Read more...Today, let’s check a data structure named Trie. It’s also called search trie or prefix trie, which is mainly used to handle string related problems.
Read more...Priority Queue A priority queue is an abstract data type, which has the behaviour somewhat like a queue. However, the first-out element is not the first-in element on time serial but the element with the highest priority in the queue. You can think it is a container holds priorities.
Read more...In this post, let’s go through linked list in a brif way. I’ll introduce basic operations of linked list in Python.🤓
Read more...😃Today I will introduce the vital part of the game which is the key class here.
Read more...Now we almost have developled the entire game, just a little coding. Today, I will introduce the class implementation based on previous analysis😃!
Read more...😁A snake game could contains lots of features, if we want to improve the previous work, we must have clues about how to make progress🤔. Next we will use OOP ideas to make a fancy snake game.
Read more...Today, I’m going to introduce pygame in a brief way. The main idea of this post is not to explain the detials of the pygame but some basic ideas of gaming programming. Let’s get started😃!
Read more...After knowing the building blocks of curses, let’s jump onto our first version of the snake game🧐.
Read more...Introduction How are you guys😀! In the next following days, I’m going to introduce an interesting and small project implemented in Python, using some third-party libraries to create a snake game. I know it’s not a big deal to complete such a project, but it really gives me a kind of enjoyment in these self-isolation days🤓.
Read more...