cc150
文章平均质量分 62
mars2014jia
这个作者很懒,什么都没留下…
展开
-
4.8 is sub tree?
You have two very large binary trees: Tl, with millions of nodes, and T2, with hundreds of nodes. Create an algorithm to decide ifT2 is a subtree ofTl. A tree T2 is a subtree of Tl if there exists a原创 2015-01-27 06:31:55 · 290 阅读 · 0 评论 -
9.10 叠箱子,不是很理解,建议做几道dp的leetcode题目
You have a stack of n boxes, with widths w., heights l\ and depths dr The boxes cannot be rotated and can only be stacked on top of one another if each box in the stack is strictly larger than the b转载 2015-02-11 06:28:03 · 708 阅读 · 0 评论 -
9.10 叠箱子 ,建议看leetcode dp部分
https://oj.leetcode.com/tag/dynamic-programming/ 原题不是很理解,接口众多原创 2015-02-11 06:58:55 · 911 阅读 · 0 评论 -
4.1 isBalanced tree
Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never diffe原创 2015-01-22 06:35:42 · 220 阅读 · 0 评论 -
Convert Sorted List to Binary Search Tree
soln recursive 解法 public class Solution { static ListNode head; // must add this public TreeNode sortedListToBST(ListNode head) { if(head==null) return null; this.he原创 2015-01-22 13:03:08 · 290 阅读 · 0 评论 -
9.8 甩硬币方式,leetcode combine sum I II
leetcode combine sum I Given a set of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T. The same repeated number may be原创 2015-02-05 07:49:44 · 352 阅读 · 0 评论 -
9.5 permuation
public class Solution { public ArrayList> permute(int[] num) { ArrayList> result = new ArrayList>(); ArrayList a = new ArrayList(); if(num==null||num.length==0) return原创 2015-02-03 12:37:53 · 246 阅读 · 0 评论 -
9.7 paintfill 抄写书
Implement the "paint fill" function that one might see on many image editing programs. That is, given a screen (represented by a two-dimensional array of colors), a point, and a new color, fill in t原创 2015-02-04 12:55:26 · 231 阅读 · 0 评论 -
9.6 print out all valid combinations of n-pairs of parentheses
leetcode 题目变种 package test; import java.util.Stack; public class isValidParenthesis { private static boolean compareChar(char c1, char c2) { switch (c1) { cas原创 2015-02-04 06:43:04 · 334 阅读 · 0 评论 -
9.6 combination
public class Solution { public ArrayList> combine(int n, int k) { ArrayList> re = new ArrayList>(); if(n if(k==1){ for(int i=1; i原创 2015-02-03 10:48:16 · 191 阅读 · 0 评论 -
9.4 subset I and II,
题目详见leetcode public class Solution { public ArrayList> subsets(int[] S) { //http://blog.csdn.net/linhuanmars/article/details/24286377 ArrayList> res = new ArrayList>(); Array原创 2015-02-03 07:58:31 · 188 阅读 · 0 评论 -
2.1 创建linkedlist hashset node
Write code to remove duplicates from an unsorted linked list. FOLLOW UP How would you solve this problem if a temporary buffer is not allowed? soln: 还有就是快指针慢指针,不说了 package test; import原创 2015-01-14 12:20:53 · 231 阅读 · 0 评论 -
1.6 图像旋转
Given an image represented by an NxN matrix, where each pixel in the image is 4 bytes, write a method to rotate the image by 90 degrees. Can you do this in place? package test; public class原创 2015-01-13 07:13:57 · 264 阅读 · 0 评论 -
1.8 判断字符串rotation
Assume you have a method isSubstring which checks if one word is a substring of another. Given two strings, si and s2, write code to check Ifs2 is a rotation of si using only onecalltoisSubstring (e原创 2015-01-13 11:30:36 · 369 阅读 · 0 评论 -
1.7 matrix set 0,重点是只保存row 和col number
Write an algorithm such that if an element in an MxN matrix is 0, its entire row and column are set to 0 package test; public class JumpTwo { public static void main(String[] args原创 2015-01-13 10:28:52 · 338 阅读 · 0 评论 -
痛定思痛开始刷cc150 压缩数据,使用stringBuffer
Implement a method to perform basic string compression using the counts of repeated characters. For example, the string aabcccccaaa would become a2blc5a3. If the "compressed" string would not become原创 2015-01-13 05:46:50 · 357 阅读 · 0 评论 -
2.7 Implement a function to check if a linked list is a palindrome
方法1 找到长度len,然后从一半开始和stack中元素比对 方法2 fast node ,slow node,hit 到终点为slow到一半 package test; //Implement an algorithm to find the kth to last element of a singly linked list. import java.util原创 2015-01-15 07:54:51 · 282 阅读 · 0 评论 -
4.7 first common ancestor
Design an algorithm and write code to find the first common ancestor of two nodes in a binary tree. Avoid storing additional nodes in a data structure. NOTE: This is not necessarily a binary search原创 2015-01-27 05:10:18 · 223 阅读 · 0 评论 -
Min Stack
Design a stack that supports push, pop, top, and retrieving the minimum element in constant time. push(x) -- Push element x onto stack.pop() -- Removes the element on top of the stack.top() -- Get转载 2015-03-03 07:42:17 · 185 阅读 · 0 评论