码迷,mamicode.com
首页 >  
搜索关键字:equal    ( 3393个结果
自己实现的字符串基本操作
#include "stdafx.h"#include #include #include #define TRUE 1#define FALSE 0#define BIG 1#define EQUAL 0#define SMALL -1unsigned int strlenth(ch...
分类:其他好文   时间:2014-06-28 20:46:07    阅读次数:141
LeetCode:Same Tree
Same Tree      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 n...
分类:其他好文   时间:2014-06-19 12:49:17    阅读次数:301
升序排列的数组中是否存在A[i]=i
#includevoid equal(int a[],int N){ int i; for(i=0;i<N;i++) { if(i<a[i]) { printf("no exist\n"); printf("%...
分类:其他好文   时间:2014-06-18 17:49:42    阅读次数:191
[LeetCode] Same Tree
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 an...
分类:其他好文   时间:2014-06-18 12:32:58    阅读次数:169
LeetCode:Merge Sorted Array
Given two sorted integer arrays A and B, merge B into A as one sorted array. Note: You may assume that A has enough space (size that is greater or equal to m + n) to hold additional ele...
分类:其他好文   时间:2014-06-17 23:05:13    阅读次数:246
leetcode - Same Tree
题目:Same TreeGiven two binary trees, write a function to check if they are equal or not.Two binary trees are considered equal if they are structurally ...
分类:其他好文   时间:2014-06-15 00:53:09    阅读次数:314
Leetcode:Partition List
Description:Given a linked list and a valuex, partition it such that all nodes less thanxcome before nodes greater than or equal tox.You should preser...
分类:其他好文   时间:2014-06-14 19:11:15    阅读次数:173
Leetcode:Partition List 链表快速排序划分
Partition ListGiven a linked list and a valuex, partition it such that all nodes less thanxcome before nodes greater than or equal tox.You should pres...
分类:其他好文   时间:2014-06-12 06:18:55    阅读次数:562
【leetcode】Merge Sorted Array
Given two sorted integer arrays A and B, merge B into A as one sorted array.Note:You may assume that A has enough space (size that is greater or equal...
分类:其他好文   时间:2014-06-10 20:44:02    阅读次数:298
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!