qq_28388867的博客

Happy NumberWrite an algorithm to determine if a number is “happy”.A happy number is a number defined by the following process: Starting with any positive integer, replace the number by the sum of...

House RobberYou are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that ...

Remove all elements from a linked list of integers that have value val.Example:Input: 1->2->6->3->4->5->6, val = 6 Output: 1->2->3->4->5 Accepted增加头节点，以防止溢出class S...

Count the number of prime numbers less than a non-negative number, n.Example:Input: 10Output: 4Explanation: There are 4 prime numbers less than 10, they are 2, 3, 5, 7.常规方法很容易超时，要使用高效的算法，这是googl...

Reverse a singly linked list.Example:Input: 1->2->3->4->5->NULLOutput: 5->4->3->2->1->NULLclass Solution {public: ListNode* reverseList(ListNode* head) { ...

Boyer-Moore Voting Algorithm 多数投票算法##Majority Element题目介绍：给定一个长度为n的数组的时候，找出其中的主元素，即该元素在数组中出现的次数大于n/2的取整。题目中已经假定所给的数组一定含有元素，且主元素一定存在。在刷leetcode 169. Majority Element 的时候发觉这个算法相当巧妙，hash表的找主成分方法时间复杂度是O...

Factorial Trailing Zeroes问n的乘方后面带几个零，这是数学题，重点在于因数中有几个10，也就是有几个2和5，而5比2要稀缺得多所以找到因数中一共是几个5就可以了。我的代码class Solution {public: int trailingZeroes(int n) { int ret=0; while(n=n/5)...

Given an array, rotate the array to the right by k steps, where k is non-negative.感觉难度不大，但是注释的两句改了好久才改好，还是水平太低class Solution {public: void rotate(vector<int>& nums, int k) { i...