v_today_v的博客

bool isHappy(int n) {     if(n return false; bool isIndatas(int*,int,int); int N=50; int* datas=(int*)malloc(N*sizeof(int)); datas[0]=n; int index=1; bool result=false; int m=n; int q=10; l

#include #include #include #include using std::set; using std::map; using std::string; bool isIsomorphic(string s, string t) { if(s.size()!=t.size()||s.size() return false; mapmap_s; setset

int hammingWeight(unsignedint n){          intcount=0;          while(n){                    count+=n&1;                    n>>=1;          }          returncount; }

uint32_t reverseBits(uint32_t n) {     unsigned int re_n=0; int index=32; while(index){ re_n+=n&1; n>>=1; if(index!=1) re_n --index; } return re_n; }

int countPrimes(int n) {     if(n return 0; int *nums=(int*)malloc(sizeof(int)*(n/2)); for(int i=0;i nums[i]=i*2+1; for(int i=3;i for(int j=i*3;j nums[j/2]=0; int count=0; for(int i=0;i if(

void rotate(int* nums, int numsSize, int k) {     void rotateSubStr(int* nums,int numsSize,int begin,int end);     if(nums==NULL||numsSize return; k=k%numsSize; rotateSubStr(nums,numsSize,0,numsS

/**  * Definition for singly-linked list.  * struct ListNode {  *     int val;  *     struct ListNode *next;  * };  */ struct ListNode* reverseList(struct ListNode* head) {     if(head==NULL)

int rangeBitwiseAnd(int m, int n) {     if(m>n) return 0; int exp=0; int re_n=n/2; while(re_n){ exp++; re_n/=2; } if(m return 0; if((m==2147483646)||(m==2147483647)) return m&n; int res=m

struct ListNode* removeElements(struct ListNode* head, int val) {     if(head==NULL){         return NULL;     } struct ListNode* result=head; struct ListNode* Index=head; while(Index!=NULL&&Ind

int max(int a,int b){ return a>b?a:b; } int rob(int* nums, int numsSize) {     if(nums==NULL||numsSize return 0; if(numsSize==1) return *nums; int pre=nums[0]; int result=max(nums[0],nums[1])