HOMERUNIT的博客

一、Problem Description:     A right-heavy tree is a binary tree where the value of a node is greater than or equal to the values of the nodes in its left subtree and less than the values of the nodes

一、问题描述 The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility) P A H

Sicily 1001  Alphacode 动态规划 一、问题描述 Alice and Bob need to send secret messages to each other and are discussing ways to encode their messages: Alice: "Let's just use a very simple code: We'll assi

1. Problem Description: The only printer in the computer science students' union is experiencing an extremely heavy workload. Sometimes there are a hundred jobs in the printer queue and you may have

Knowledge points Exception Handling(try, catch and throw), polymorphic, string Introduction We are going to write a program to calculate a string with some simbols, say a simple calculator. You nee

各种方法建立二叉树 //非递归建立二叉树 struct node{ char data; node* left; node* right; }; void createtree() { node* q; node* tree[max]; int i, j; char val; node* root = NULL; cin >> i >> val; while (i !=

一、Problem Given a binary tree, every node has a weight, then you need to find out the path that can make the total weight of all nodes it go through is the maximum and show the path. The weight is al

一、Problem description You are provided a maze(迷宫), and you need to program to find the least steps to walk from the start to the end.And you can only walk in four directions:up, down,left, right.

一、问题描述 Given a positive integer n and you can do operations as follow: If n is even, replace n with n/2.If n is odd, you can replace n with either n + 1 or n - 1. What is the minimum nu