xiaowovicky的博客

class Solution {public:    int addDigits(int num) {        do{            int n=num,i;            for(i=0;n!=0;i++)            n/=10;            int a[i];            int m=num;     

class Solution {public:    vector topKFrequent(vector& nums, int k) {        map mp;        map ::iterator i;        for (int i=0;i        mp[nums[i]]++;  //Map中的元素是自动按key升序排序,所以不能对map用so

Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the array, and it should return false if every element

Write a program to check whether a given number is an ugly number.Ugly numbers are positive numbers whose prime factors only include 2, 3, 5. For example, 6, 8 are ugly while 14 is not ugly sinc

class Solution {public:    int maxProfit(vector& prices) {        if(prices.size()        int min=prices[0],maxpro=0,max=0;        for (int i=1;i            if(prices[i-1]>prices[i]){   

/** * Definition for singly-linked list. * struct ListNode { *     int val; *     ListNode *next; *     ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public:    Li

class Solution {public:    vector> generate(int numRows) {        vector p;        vector> pp;        if(numRows        else{        if(numRows==1){           p.push_back(1);       

class Solution {public:    vector getRow(int rowIndex) {/*      vector p;        if(rowIndex        else{            if (rowIndex==0){            p.push_back(1);            }       

Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.You may assume that the array is non-empty and the majority element

Write a function that takes a string as input and returns the string reversed.Example: Given s = “hello”, return “olleh”.class Solution {public:    string reverseString(string s) {

class Solution {public:    vector productExceptSelf(vector& nums) {        int n=nums.size(),right=1,left=1;        vector res(n,1);        for(int i=0;i        res[i]*=right;        rig