摘要:
题目描述 Write a function that takes an unsigned integer and returns the number of '1' bits it has (also known as the Hamming weight). 实例 Input: 11 Output 阅读全文
摘要:
90分,不知道错在哪里了,dijkstra算法,用一个数组的 表示以i点结尾的小路的长度,以i点为中心扩展时,若下一点为k,如果 是小路,则 否则直接加路径长度即可,同时把 C++ include include include include include include using names 阅读全文