码迷,mamicode.com
首页 >  
搜索关键字:cc150    ( 107个结果
CC150:将一个矩阵旋转90度
将一个矩阵旋转90度...
分类:其他好文   时间:2014-11-10 01:14:21    阅读次数:225
LeetCode 刷题总结
最近找工作,免不了看CC150 刷 LeetCode 来练手,练习之余也向各路大神 系统并且深入的学习、巩固一下算法知识。一. 线性表1. 数组 Remove Duplicates from Sorted Array Remove Duplicates from Sorted Array II .....
分类:其他好文   时间:2014-09-10 08:21:50    阅读次数:246
CC150 - 11.6
Question:Given an M x N matrix in which each row and each column is sorted in ascending order, write a method to find an element. 1 package POJ; 2 3 ....
分类:其他好文   时间:2014-09-01 02:44:02    阅读次数:209
CC150 - 11.5
Question:Given a sorted array of strings which is interspersed with empty strings, write a method to find the location of a given string. 1 package P....
分类:其他好文   时间:2014-08-23 15:09:11    阅读次数:179
判断T2是否是T1的子树
基本模仿CC150上的思路,递归地在t1中寻找能与t2的根相同的节点,作为开始比较的开始点,然后递归的比较两个树是否相等。boolean containsTree(TreeNode t1, TreeNode t2){ if(t2==null) return true; ...
分类:其他好文   时间:2014-08-22 22:32:39    阅读次数:457
CC150 - 11.3
Question:Given a sorted array of n integers that has been rotated an unknown number of times, write code to find anelement in the array. You may assum...
分类:其他好文   时间:2014-08-21 02:46:43    阅读次数:194
CC150 - 11.2
Question:Write a method to sort an array of strings so that all the anagrams are next to each other. 1 package POJ; 2 3 import java.util.Arrays; 4 im....
分类:其他好文   时间:2014-08-20 02:41:34    阅读次数:199
CC150 - 11.1
Question:You are given two sorted arrays, A and B, where A has a large enough buffer at the end to hold B.Write a method to merge B into A in sorted o...
分类:其他好文   时间:2014-08-19 23:51:25    阅读次数:309
CC150 1.1 字符串查唯一bit manipulation详解
public boolean isUniqueChars2(String str) { int checker = 0; for (int i = 0; i 0) { return false; } else ...
分类:其他好文   时间:2014-08-14 19:24:39    阅读次数:250
CC150 需整理汇总
汉诺塔问题:P141用两个stack设计一个队列 p142 结合上题,队列实现max操作,要求尽量提高效率。(编程之美)找出二叉树中指定节点的下一个节点(中序后继),假定每个节点有父指针。p154二叉树某两个节点的公共祖先。p155判断T2是否是T1的子树。p159打印二叉树节点数值总和等于某个给....
分类:其他好文   时间:2014-08-12 00:13:23    阅读次数:346
107条   上一页 1 ... 8 9 10 11 下一页
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!