摘要：
Strongly Connected Components <!-- .entry-header --> A directed graph is strongly connected if there is a path between all pairs of vertices. A strong 阅读全文
摘要：
若出现类似Product activation must be completed within 5 days 的错误，解决办法 注意第2步很重要，注册码的验证需要公钥私钥配对，所以一定要用算号时使用的 阅读全文
摘要：
Following features of C++ are not there in Java. No pointers No sizeof operator No scope resolution operatorLocal variables in functions cannot be sta 阅读全文
摘要：
#include using namespace std; int divide(int dividend, int divisor) { long long n = dividend, m = divisor; // determine sign of the quotient int sign = n = 0; i--) if (t ... 阅读全文
摘要：
Finding Shortest Paths By BFS The BFS code we have seen find outs if there exist a path from a vertex s to a vertex v prints the vertices of a 阅读全文
摘要：
https://leetcode.com/problems/word-ladder-ii/ Given two words (beginWord and endWord), and a dictionary's word list, find all shortest transformation 阅读全文
摘要：
https://leetcode.com/problems/word-ladder/ Given two words (beginWord and endWord), and a dictionary's word list, find the length of shortest transfor 阅读全文
摘要：
阅读全文
摘要：
https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii/ Follow up for problem "Populating Next Right Pointers in Each Node". Wha 阅读全文
摘要：
https://leetcode.com/problems/binary-tree-right-side-view/ Given a binary tree, imagine yourself standing on the right side of it, return the values o 阅读全文