hikaru0123的博客

#include<iostream>#include<map>using namespace std;int f(int *p,int n) { if (p == NULL || n <= 0) return INT_MIN; int min = p[0]; int v = INT_MIN; for (int i = 1; i < n; i++)...

int num=0;void Translation(string s, int n) { if (n == s.length()) { num++; } else if(n<s.length()){ Translation(s, n + 1); if (n<s.length() - 1 && (((s[n] - '0')*10 + s[n + 1]...

#include<iostream>using namespace std;int FindMaxSum(int *num,int len) { if (num == NULL||len<=0) return -1; int max = 0, i = 1,sum = num[0]; while (i<len){ if (sum < num[i]&amp...

#include<iostream>#include<set>#include<vector>#include<iomanip>#include <functional>//greater,less的模板using namespace std;void MinK(const vector<int> v,int ...

#include<iostream>using namespace std;int MoreHalfNum(int *num,int len){ int x=num[0],count=1; for (int i = 1; i < len; i++) { if (num[i] == x) count--; if (count == 0) { x = num[...

#include<iostream>using namespace std;void Permutation(char* s,char* p) { if (*p=='\0') cout << s << endl; for (char* begin = p; *begin != '\0'; begin++){ swap(*begin,*p); P...

#include<iostream>using namespace std;struct ListNode{ int value; ListNode* next; ListNode* sp;};ListNode* Copy(ListNode* t) { ListNode *k=NULL; ListNode* p = t; while (p != NULL) {...

#include<iostream>#include<algorithm>using namespace std;char* Change(char *c,int num,int n) { int i = 0, j = num - 1; while (i < j) swap(c[i++],c[j--]); i = num - n; j = num - 1...

#include<iostream>#include<algorithm>using namespace std;char* Overturn(char *c,int n) { int i = 0, j = n - 1; while (i<j) swap(c[i++],c[j--]); int p = 0,q = 0; while (c[q]!='\0...

struct TreeNode { TreeNode* left; TreeNode* Right; double value;};void path(TreeNode *t,int sum,int n,vector<TreeNode *> &v) { if (n == sum&&t->left==NULL&&t->Ri...

#include<iostream>using namespace std;struct TreeNode { TreeNode* left; TreeNode* Right; double value;};void Exchange(TreeNode *t) { if (t!=NULL) { swap(t->left,t->Right); E...

#include<iostream>#include<string>using namespace std;int MaxValue(int *v,int m,int n) { if (v == NULL || m <= 0 || n <= 0) return 0; int**max = new int*[m]; for (int i = 0; i...

#include<iostream>#include<string>using namespace std;void longestString(const char* s) { if (s == NULL) return; int i = 0, j = 1, position[26],maxi=i,maxj=i; for (int k = 0; k <...

#include<iostream>#include<string>#include<map>using namespace std;char OneNum(char *s) { map<char, int> m; int i = 0; while(s[i] != '\0') { m[s[i]]++; i++; } i =...

#include<iostream>#include<map>using namespace std;bool f(int *p) { map<int, int> m; int i = 0; while (i<5){ if (m.find(p[i]) != m.end() && p[i] != 0) return fals...

#include<iostream>#include<algorithm>using namespace std;void Print(int b,int t) { if (b % 2) { int i = b / 2; while (i >= 1) { cout << t - i<<" "; i--; } ...

#include<iostream>#include<algorithm>using namespace std;void Find(int data[],int n,int s,int* num1,int* num2) { int i = 0,j=n-1; while (i<j) { if (data[i] + data[j] > s) j...

#include<iostream>#include<algorithm>using namespace std;int Find(int data[],int n) { if (data == NULL||n<=0) exit(0); int a[32]={0}; for (int i = 0; i < n; i++){ int x = da...

#include<iostream>#include<algorithm>using namespace std;void Find(int data[],int n,int* num1,int* num2) { int x=0; for (int i = 0; i < n;i++) { x ^= data[i] ; } int t = 1; w...

#include<iostream>#include<algorithm>using namespace std;struct TreeNode { TreeNode* l; TreeNode* r; int value;};int b = 1;int depth(TreeNode *t) { if (!t) { return 0; } if...

#include<iostream>#include<algorithm>using namespace std;struct TreeNode { TreeNode* l; TreeNode* r; int value;};int depth(TreeNode *t,int h) { if (t == NULL) return h; else re...

#include<iostream>using namespace std;class Solution {public: int Find(int* p,int b, int e) { int i = b, j = e, mid=(e-b)/2+b; if (p[mid] == mid) { return mid; } else if(i<=j)...

#include<iostream>using namespace std;class Solution {public: int Find(int* p,int n) { int i = 0, j = n - 2,mid; while (i<=j){ mid = (j - i) / 2 + i; if (p[mid] > mid) { ...

class Solution {public: int Begin(int *num,int n,int k) { int i = 0, j = n - 1,mid; while (i<=j){ mid = (j - i)/2 + i; if (num[mid] == k) { if (mid > 0 && num[mid - 1] ==...

#include<iostream>using namespace std;struct ListNode { ListNode(int x = 0) { value = x; } ListNode* next; int value;};ListNode* FristCommonNode(ListNode* a,ListNode* b) { ListNode* aa...

#include<iostream>using namespace std;struct TreeNode { TreeNode* left; TreeNode* Right; double value;};int check(char *v,int len) { if (v == NULL||len<=0) return 0; int i; if (le...

#include<iostream>using namespace std;struct TreeNode { TreeNode* left; TreeNode* Right; double value;};bool Equal(TreeNode *a, TreeNode *b) { if (a == NULL || b == NULL) return false;...

#include<iostream>#include<queue>using namespace std;struct TreeNode { TreeNode* left; TreeNode* Right; double value;};void Print(TreeNode *t) { if (t == NULL) return; queue&lt...

#include<iostream>using namespace std;struct ListNode { int value; ListNode* next;};ListNode* Find(ListNode* head){ ListNode*fast=head->next, *slow=head; while (fast!=slow){ fast ...

#include<iostream>using namespace std;struct TreeNode { TreeNode* left; TreeNode* Right; double value;};bool checkin(TreeNode* a, TreeNode* b) { if (a == b&&b == NULL) return t...

#include<iostream>using namespace std;struct ListNode { int value; ListNode* next;};ListNode* Find(ListNode* head,int n){ ListNode *p=head, *q=head; int num = 0; if (head == NULL||n==...

#include<iostream>using namespace std;bool check(int x) { return (x & 1) == 0;}//判断是否为偶数void moveNum(int *v,int len,bool(*f)(int)) { if (v == NULL || len == 0) return; int *p = v, *...

#include<iostream>using namespace std;class Solution {public: bool checkInt(char **s) { if (**s == '-' || **s == '+') (*s)++; char *p = *s; while (*s!=NULL&&**s>='0'&&a...

#include<iostream>#include<vector>#include<string>#include<stack>using namespace std;struct ListNode{ int nValue; ListNode* pNext;};void Print(ListNode *head) { st...

#include<iostream>#include<vector>#include<string>using namespace std;class Solution {public: void ReplaceBlank(char s[],int length) { if (length == 0) return; int count =...

 #include<iostream>#include<vector>using namespace std;class Solution {public: bool Find(int *matrix,int rows,int colums,int number) { int i = 0; int j = colums-1; if (matrix !...

#include<iostream>using namespace std;bool check(char* str, char* pattern,int i,int j) { if (str[i] == '\0'&&pattern[j] == '\0') return true; if (str[i] == '\0'&&pattern[j] ...

#include<iostream>#include<vector>using namespace std;class Solution {public: int duplicate(vector<int> numbers) { int i = 0; while(i < numbers.size()) { if (numbe...

#include<iostream>using namespace std;struct ListNode { int value; ListNode* pnext;};void DeleteNode(ListNode** pListHead,ListNode* pDeleted) { if (!pListHead || !pDeleted) return; if ...

#include<iostream>using namespace std;struct ListNode { int value; ListNode* next;};ListNode* ReverseList(ListNode* head){ if (!head) return NULL; ListNode*p=head, *q=NULL,*h=head->...