yangzhuhappy-优快云博客

原创 Sorted Merge java 走地牙 CTCI 10.1

public class Solution { /* * @param A: sorted integer array A which has m elements, but size of A is m+n * @param m: An integer * @param B: sorted integer array B which has n elemen...

2019-04-27 04:27:01 212

原创 Boolean Evaluation Java 走地牙 CTCI 8.14

Boolean Evaluation:Given a boolean expression consisting of the symbols 0 (false), 1 (true), & (AND), I (OR), and /\ (XOR), and a desired boolean result value result, implement a function to coun...

2019-04-25 02:54:44 281

原创 Eight Queens Java 走地牙 CTCI 8.12

package com.company; import java.util.*; /* * Eight Queens:Write an algorithm to print all ways of arranging eight queens on an 8x8 chess board * so that none of them share the same row, column, or d...

2019-04-21 23:09:57 253

原创 Coins Java 走地牙 CTCI 8.11

package com.company; /* * Coins: Given an infinite number of quarters (25 cents), dimes (1O cents), * nickels (5 cents), and pennies (1 cent), write code to calculate the number of ways of represent...

2019-04-20 21:35:59 244

原创 Paint Fill java 走地牙 CTCI 8.10

package com.company; /* * Paint Fill: 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 color...

2019-04-18 04:05:21 252

原创 Parens/Generate Parentheses java 走地牙 CTCI 8.9

Parens:Implement an algorithm to print all valid (i.e., properly opened and closed) combinations of n pairs of parentheses. public class Solution { /** * @param n: n pairs * @return...

2019-04-17 03:17:04 197

原创 Permutations with Duplicates java 走地牙 CTCI 8.8

package com.company; import java.util.*; /* * Permutations with Duplicates: Write a method to compute all permutations * of a string whose characters are not necessarily unique. The list of permuta...

2019-04-16 07:41:15 191

原创 Permutations without Dups java 走地牙CTCI 8.7

import java.util.*; /* * Permutations without Dups: Write a method to compute all permutations of a string of unique characters. * */ public class Main { public static void main(String[] args) ...

2019-04-15 00:11:53 164

原创 Towers of Hanoi 递归和构建 java 走地牙 CTCI 8.6

Towers of Hanoi:In the classic problem of the Towers of Hanoi, you have 3 towers and N disks of different sizes which can slide onto any tower. The puzzle starts with disks sorted in ascending order ...

2019-04-14 03:48:06 367

原创 Recursive Multiply java 走地牙 CTCI 8.5

/* * Recursive Multiply: Write a recursive function to multiply two positive integers without using the * operator * (or / operator). You can use addition, subtraction, and bit shifting, but you shou...

2019-04-13 02:09:04 189

原创 Power Set/subset1/subset2/ java走地牙 CTCI 8.4

Power Set:Write a method to return all subsets of a set. subset 1;没有重复数字； public class Solution { /** * @param nums: A set of numbers * @return: A list of lists */ public Lis...

2019-04-12 04:46:57 256

原创 Magic Index java 走地牙 CTCI 8.3

/* * Magic Index: A magic index in an array A[ 1.•.n-1] is defined to be an index such that A[ i] i. Given a sorted array of distinct integers, write a method to find a magic index, if one exists, in...

2019-04-10 03:19:57 153

原创 Robot in a Grid: java 走地牙 CTCI 8.2

Robot in a Grid:Imagine a robot sitting on the upper left corner of grid with r rows and c columns.The robot can only move in two directions, right and down, but certain cells are "off limits" such t...

2019-04-09 22:21:09 209

原创 Triple Step java 走地牙 8.1 CTCI

Triple Step:A child is running up a staircase with n steps and can hop either 1 step, 2 steps, or 3 steps at a time. Implement a method to count how many possible ways the child can run up the stairs...

2019-04-09 09:20:15 200

原创 The Egg Drop Problem java走地牙CTCI 6.8

public class Main { public static void main(String[] args) { System.out.println("Hello World!"); System.out.println(findBreakPoint()); } public static int findBreakPoint...

2019-04-01 22:53:41 302

原创 Conversion java 走地牙CTCI 5.6

/* 5.6 Conversion: Write a function to determine the number of bits you would need to flip to convert integer A to integer B. EXAMPLE Input: 29 (or: 11101), 15 (or: 01111) Output: 2 */ public class M...

2019-03-30 03:11:00 249

原创 Next Number java 走地牙CTCI 5.4

/* Next Number: Given a positive integer, print the next smallest and the last largest number that have the same number of 1 bits in their binary representation. 方法是：1：最小下一个：11011001111100 相同数量的1的情况下...

2019-03-29 04:52:55 236

原创 Binary to String java 走地牙 CTCI 5.2

/* Binary to String: Given a real number between 0 and 1 (e.g., 0.72) that is passed in as a double, print the binary representation. If the number cannot be represented accurately in binary with at ...

2019-03-26 03:39:37 234

原创 Insertion java 走地牙 CTCI 5.1

/* Insertion: You are given two 32-bit numbers, N and M, and two bit positions, i and j. Write a method to insert Minto N such that M starts at bit j and ends at bit i. You can assume that the bits...

2019-03-26 03:06:13 167

原创 Random Node java 走地牙 CTCI 4.11

import java.util.*; public class TreeNode { private int val; public TreeNode left, right; private int size = 0; public TreeNode(int val) { this.val = val; size = 1; ...

2019-03-25 08:01:45 260

原创 Paths with Sum java 走地牙CTCI 4.12 有坑

/* 不能这样算 1 2 3 4 假设这样的tree target 是6 用下面的算法 2-4 这个组合会被算两变应该用的方法：写一个方法只算每次剪掉root.val的值，另外再把没剪掉的重新递归；看下面的code； class Solution { public int pathSum(TreeNode root, int...

2019-03-25 04:01:09 188

原创 BST Sequences java 走地牙CTCI 4.9 结果会输出四遍不知道原因！！！！！

/* 4.9 BST Sequences: A binary search tree was created by traversing through an array from left to right and inserting each element. Given a binary search tree with distinct elements, print all possi...

2019-03-24 04:45:26 312

原创 Check Subtree java 走地牙 CTCI 4.10

/* CTCI 4.10 有陷阱注意可能会有重复的val 导致不能分部递归，为了避免重复使用嵌套递归； */ /** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNo...

2019-03-24 04:44:03 174