Note: I'm currently taking a break from this course to focus on my studies so I can finally graduate
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| In my blog, I will share what I have learned so far, and what I continue to learn about embedded system, IOT, and software programming. | |
| Below are some of the websites that I visit as a daily base. | |
| 1. [embedded](https://www.embedded.com/) | |
| 1. [hackaday](https://hackaday.com/) | |
| 1. [respberrypi](https://www.raspberrypi.org/) | |
| 1. [embedded muse](http://www.ganssle.com/tem-subunsub.html) |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| vids |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| /* This is one of the solution set to CareerCup 150 problems. | |
| * | |
| * Problem 2.6 | |
| * | |
| * Method: Use two pointers, one with speed 1 and another with speed 2, | |
| * they will end up meeting if the linked list has a loop. And when they meet, | |
| * set the Slow Runner to the head, start iterate, and when they meet again, | |
| * the new meeting point will be the start of the loop. | |
| * | |
| * |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| /* This is one of the solution set to CareerCup 150 problems. | |
| * | |
| * Problem 2.7 | |
| * | |
| * Method: Get the middle of the list, reverse the second half, | |
| * compare the first and the second half. | |
| * | |
| * Author: Hu Kun (Kimurate) | |
| * Date: 03/03/2013 | |
| * Compile command: gcc-4.7 2.7.c -std=c99 |