main()
{
P1DIR = 0xFF;
while(1)
{
n1();
delay(65000);
n2();
delay(65000);
n3();
delay(65000);
n4();
delay(65000);
n5();
delay(65000);
n6();
delay(65000);
n7();
delay(65000);
n8();
delay(65000);
n9();
delay(65000);
n0();
delay(65000);
}
}
int main() {
TreeNode n1(5);
TreeNode n2(4);
TreeNode n3(8);
TreeNode n4(11);
TreeNode n5(13);
TreeNode n6(4);
TreeNode n7(7);
TreeNode n8(2);
TreeNode n9(1);
n1.left = &n2;
n1.right = &n3;
n2.left = &n4;
n4.left = &n7;
n4.right = &n8;
n3.left = &n5;
n3.right = &n6;
n6.right = &n9;
Solution sln;
cout << sln.hasPathSum(&n1, 22) << endl;
return 0;
}
int main(){
node n1(1);
node n2(2);
node n3(3);
node n4(4);
node n5(5);
node n6(6);
node n7(7);
node n8(8);
node n9(9);
node n10(10);
int main() {
// init data
TreeNode n6(6);
TreeNode n2(2);
TreeNode n8(8);
TreeNode n0(0);
TreeNode n4(4);
TreeNode n7(7);
TreeNode n9(9);
TreeNode n3(3);
TreeNode n5(5);
n6.left = &n2;
n6.right = &n8;
n2.left = &n0;
n2.right = &n4;
n8.left = &n7;
n8.right = &n9;
n4.left = &n3;
n4.right = &n5;
// 测试 fillMapParents
Solution sol;
map<TreeNode*, TreeNode*> mapParents;
sol.fillMapParents(&n6, mapParents);
sol.printMapParents(mapParents);
// 测试 depth
sol.printAllNodesDepth(mapParents, &n6);
// 测试 traverseUpward
TreeNode* tempNode = &n2;
sol.traverseUpward(tempNode, 1, mapParents);
// 测试 lowestCommonAncestor
TreeNode* v = &n2;
TreeNode* w = &n4;
TreeNode* lca = sol.lowestCommonAncestor(&n6, v, w);
cout << endl << v->val << ", " << w->val << " 的 LCA 是 " << lca->val << endl << endl;
v = &n2;
w = &n8;
lca = sol.lowestCommonAncestor(&n6, v, w);
cout << endl << v->val << ", " << w->val << " 的 LCA 是 " << lca->val << endl << endl;
return 0;
}
int main() {
{
/*
_______6______
/ \
___2__ ___8__
/ \ / \
0 _4 7 9
/ \
3 5
*/
Node n1( 6 );
Node n2( 2 );
Node n3( 8 );
Node n4( 0 );
Node n5( 4 );
Node n6( 7 );
Node n7( 9 );
Node n8( 3 );
Node n9( 5 );
n1.left = &n2;
n1.right = &n3;
n2.left = &n4;
n2.right = &n5;
n3.left = &n6;
n3.right = &n7;
n5.left = &n8;
n5.right = &n9;
const Node * p = lca_bst( &n1, &n8, &n9 );
assert( p == &n5 );
p = lca_bst( &n1, &n2, &n8 );
assert( p == &n2 );
p = lca_bst( &n1, &n7, &n9 );
assert( p == &n1 );
Node n10( 10 );
p = lca_bst( &n1, &n2, &n10 );
assert( p == nullptr );
}
return 0;
}
void shreeman()
{
sss(xnxt,ynxt,h,ws);
hhh(xnxt,ynxt,h,wh);
rrr(xnxt,ynxt,h,wr);
eee(xnxt,ynxt,h,we);
eee(xnxt,ynxt,h,we);
mmm(xnxt,ynxt,h,wm);
aaa(xnxt,ynxt,h,wa);
nnn(xnxt,ynxt,h,wn);
xnxt+=s/2;
n1(xnxt,ynxt,h,w1);
n1(xnxt,ynxt,h,w1);
iii(xnxt,ynxt,h,wi);
ttt(xnxt,ynxt,h,wt);
n8(xnxt,ynxt,h,w8);
n9(xnxt,ynxt,h,w9);
}
int main()
{
ListNode n6(10);
ListNode n7(3);
ListNode n8(45);
ListNode n9(1);
ListNode n10(38);
ListNode n11(89);
n6.next = &n7;
n7.next = &n8;
n8.next = &n9;
n9.next = &n10;
n10.next = &n11;
ListNode* n = reverseList(&n6);
while(n)
{
printf("%d->", n->val);
n = n->next;
}
return 0;
}
void sctensdigit(int a) //ten's place
{
s=30;
xnxt=400-45;
ynxt=100;
w9=w8=w4=w6=w5=w2=w3=w7=w0=wk=we=wf=wj=wl=wp=wr=ws=s/2;//1/2
w1=wi=s/4;
wg=wc=wh=wn=wb=wu=wt=wv=wx=wy=2*s/3;//2/3
ww=wm=wa=wd=wo=wq=wz=3*s/4;//3/4
h=s;//1
glColor3f(0,0,0);
glPointSize(2.0);
switch(a)
{
case 0:n0(xnxt,ynxt,h,w0);
xnxt-=(w1+sp);
ynxt-=3*s/2;
break;
case 1:n1(xnxt,ynxt,h,w1);
xnxt-=(w1+sp);
ynxt-=3*s/2;
break;
case 2: n2(xnxt,ynxt,h,w2);
xnxt-=(w1+sp);
ynxt-=3*s/2;
break;
case 3: n3(xnxt,ynxt,h,w3);
xnxt-=(w1+sp);
ynxt-=3*s/2;
break;
case 4: n4(xnxt,ynxt,h,w4);
xnxt-=(w1+sp);
ynxt-=3*s/2;
break;
case 5: n5(xnxt,ynxt,h,w5);
xnxt-=(w1+sp);
ynxt-=3*s/2;
break;
case 6: n6(xnxt,ynxt,h,w6);
xnxt-=(w1+sp);
ynxt-=3*s/2;
break;
case 7: n7(xnxt,ynxt,h,w7);
xnxt-=(w1+sp);
ynxt-=3*s/2;
break;
case 8: n8(xnxt,ynxt,h,w8);
xnxt-=(w1+sp);
ynxt-=3*s/2;
break;
case 9: n9(xnxt,ynxt,h,w9);
xnxt-=(w1+sp);
ynxt-=3*s/2;
break;
default: break;
}
glFlush();
return ;
}
