Sunburst的专栏

public class MyAllSortTest1 { //private static int m=4; public static void Allsort(int a[],int k,int m) { if (k==m) { for (int i = 0; i <= m; i++) { Sys

import java.util.Scanner;public class TheLengthPalindromicNumber1 { public static void main(String[] args) { Scanner in = new Scanner(System.in); int n = in.nextInt(); while (

Given two binary trees, write a function to check if they are equal or not. Two binary trees are considered equal if they are structurally identical and the nodes have the same value./** * Definition

Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node./** * Definition for binary tree * stru

有一个int型数组，每两个相邻的数之间的差值不是1就是-1.现在给定一个数，要求查找这个数在数组中的位置。 其实思想就是跳跃查找，因为你知道了一个数，那么它第二个数最多相差1，第三个数最多相差2，而可以用目标数减去这个数来排除一些多余的查找，比如你要的数是10，第一个数是2，那么它前7个数无论如何都达不到10，只有在第8个数才有可能，所以可以直接判断第8个数。 下面是别人的代码借用一下思想大概就

/*typedef struct l{ char data[250]; int top;}stack;void stackinit(stack &w){ w.top=-1;}void stackcreat(stack &w,char ch[]){ char *h; h=ch; cout<<"栈中字符："<<endl; while(*h!='#') {

#include<stdio.h>#include<string>#include<iostream>using namespace std;#define StackSize 100typedef char DataType;typedef struct{ DataType data[StackSize]; int top;}SeqStack;/*void Int(S

#include<stdio.h>#include<stdlib.h>#define OK 1;#define ERROR 0;typedef int Status;typedef int Elemtype;typedef struct Cnode{ Elemtype data; struct Cnode *next;}CNode;CNode *joseph;Sta

世界上有10种人，一种懂二进制，一种不懂。那么你知道两个int32整数m和n的二进制表达，有多少个位(bit)不同么？ 输入例子: 1999 2299输出例子: 7class Solution {public: /** * 获得两个整形二进制表达位数不同的数量 * * @param m 整数m * @param n 整数n * @

#include<stdio.h>#include<stdlib.h>typedef int ElemType;typedef struct Node{ ElemType data;struct Node *next;}Node,LinkList;void Insert(LinkList *L,LinkList *p);void Build(LinkList *L){//建立一个空

#include <stdio.h>#include <math.h>#include <string.h>#include <malloc.h>#include <stdlib.h>#define format "%d\n%s\n%f\n%f\n%f\n"#define len sizeof(stu)typedef struct student{ long num;

例如给出 数组 1 1 1 2 1 1(数字可正可负可0),要求定值为3 则子数组应该[1,1,1],输出长度为3#include<iostream>#include<algorithm>#include<map>using namespace std;int max(int a, int b){ if (a > b) return a; return b;}int m