努力前行吧-CSDN博客

转载二叉树层次遍历，深度计算(递归+非递归)

import java.util.LinkedList;import java.util.List;public class BinaryTreeDeep { public static void main(String[] args){ Tree tree1=new Tree("1"); Tree tree2=new Tree("2"); ...

2019-01-08 17:49:55 2193

转载 draw9patch使用

绘制之前先来说一下.9图片的四条黑边的意义，每条黑边的意义都不一样。顶部：在水平拉伸的时候，保持其他位置不动，只在这个点的区域做无限的延伸（拷贝）左边：在竖直拉伸的时候，保持其他位置不动，只在这个点的区域做无限的延伸（拷贝）底部：在水平拉伸的时候，指定图片里的内容显示的区域右边：在竖直拉伸的时候，指定图片里的内容显示的区域

2017-04-29 20:50:29 545

转载安卓scale动画fromDegrees toDegrees解释

（注意以下实验都是相对于自己（0.0f【上】，1.0f【下】），如果想了解安卓scale动画pivotX，请点击这里）在安卓中，fromDegrees是开始的角度，toDegrees是介绍的角度其中X轴右面是0度如果toDegrees比fromDegrees大，则右旋转实验(0-40) (-40-0)

2017-04-28 16:51:45 2640

转载安卓scale动画pivotX详解

pivotXType int: Specifies how pivotXValue should be interpreted. One of Animation.ABSOLUTE, Animation.RELATIVE_TO_SELF, or Animation.RELATIVE_TO_PARENT.

2017-04-28 15:22:34 2203

转载正则表达式

import java.util.regex.Matcher;import java.util.regex.Pattern;import com.sun.xml.internal.ws.api.streaming.XMLStreamWriterFactory.Zephyr;public class demo01 { public static void main(String[]

2017-03-21 09:49:32 365

转载安卓检测设备网络变化

NetWorkStateReceiverpackage cn.edu.jlnu.checknetstate.receiver;import android.content.BroadcastReceiver;import android.content.Context;import android.content.Intent;import android.net.Connectiv

2017-01-11 21:03:47 276

转载 AsyncTask异步任务

package cn.edu.jlnu.asytask;import android.os.AsyncTask;import android.support.v7.app.AppCompatActivity;import android.os.Bundle;import android.util.Log;import android.view.View;import android.

2016-10-06 18:47:19 504

转载 handler用法

package cn.edu.jlnu.asymessage;import android.os.Handler;import android.os.Message;import android.support.v7.app.AppCompatActivity;import android.os.Bundle;import android.util.Log;import androi

2016-10-05 20:51:51 204

转载安卓四种线程池

package cn.edu.jlnu.threaddemo;import android.support.v7.app.AppCompatActivity;import android.os.Bundle;import android.util.Log;import android.view.View;import android.widget.Button;import jav

2016-10-05 16:21:07 233

转载 Android实现DrawerLayout

1.custom_drawer.xml<android.support.v4.widget.DrawerLayout xmlns:android="http://schemas.android.com/apk/res/android" android:id="@+id/drawer" android:layout_width="match_parent" an

2016-09-27 10:11:01 306

转载 Til the Cows Come Home（最短路径）

Til the Cows Come HomeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 36299 Accepted: 12352DescriptionBessie is out in the field and wants to get back t

2015-08-30 09:58:54 576

转载 Immediate Decodability（C++ Stl -----substr判断前缀）

Immediate DecodabilityTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2329 Accepted Submission(s): 1205Problem DescriptionAn

2015-08-30 09:15:31 641

转载 Immediate Decodability(字典树-判断是否存在前缀)

Immediate DecodabilityTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2328 Accepted Submission(s): 1205Problem DescriptionAn

2015-08-30 09:01:15 496

转载 Genealogical tree（拓扑排序）

Genealogical treeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3773 Accepted: 2508 Special JudgeDescriptionThe system of Martians' blood relations

2015-08-29 16:44:52 371

转载 Catch That Cow（BFS）

Catch That CowTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 62027 Accepted: 19403DescriptionFarmer John has been informed of the location of a fugitiv

2015-08-28 13:30:22 326

转载 Orders（C++ stl next_permutation）

OrdersTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 9928 Accepted: 6040DescriptionThe stores manager has sorted all kinds of goods in an alphabetical

2015-08-28 12:46:04 327

转载 Fractions Again?!

Fractions Again?!Time Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %lluSubmit StatusDescription#include#include#include#includeusing na

2015-08-12 20:28:16 362

转载 Division

DivisionTime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %lluSubmit StatusDescriptionWrite a program that finds and displays all pairs of 5-di

2015-08-12 13:17:58 427

转载 Problem C: P1053

Problem C: P1053Time Limit: 0 Sec Memory Limit: 128 MBSubmit: 13 Solved: 1[Submit][Status][Web Board]Description在初赛普及组的“阅读程序写结果”的问题中，我们曾给出一个字符串展开的例子：如果在输入的字符串中，含有类似于“d-h”或“4-8”的子串，我们

2015-08-05 16:18:09 704

转载最长不重复子串（动态规划最长不重复子串+Hash）

题目1530：最长不重复子串时间限制：1 秒内存限制：128 兆特殊判题：否提交：1138解决：373题目描述：最长不重复子串就是从一个字符串中找到一个连续子串，该子串中任何两个字符都不能相同，且该子串的长度是最大的。输入：输入包含多个测试用例，每组测试用例输入一行由小写英文字符a,b,c...x,

2015-08-02 13:50:43 1352

转载 Jerry Lee’s Stones(动态规划（最长不重复子串）+Hash)

1240: Jerry Lee’s StonesTime Limit: 1 Sec Memory Limit: 128 MBSubmit: 48 Solved: 3[Submit][Status][Web Board]DescriptionJerry Lee the entrepreneur has a cool business idea: packaging

2015-08-02 13:46:26 539

转载 Coins（多重背包+二进制优化）

CoinsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 9658 Accepted Submission(s): 3843Problem DescriptionWhuacmers use coins.

2015-08-02 11:32:12 384

转载 Dividing(多重背包+二进制优化)

DividingTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 63688 Accepted: 16498DescriptionMarsha and Bill own a collection of marbles. They want to split

2015-08-02 09:09:56 396

转载多重背包的取模优化

取模优化当输入样本特别大时，比如给出上百万件物品，这时候仅靠优化算法仍然不能使运行时间降到满意的范围。可考虑如何减少输入样本。poj1014的discussion上有一个非常巧妙的“取模优化”法。设价值为v(1如果该问题不可分，那么n-2件v仍然不可分，依次类推，用s或 s-1替换n仍然不可分如果该问题可分，即可分成价值相等的两堆。分两种情况考虑：

2015-08-01 18:37:17 599

转载 Subsequence

SubsequenceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5092 Accepted Submission(s): 1691Problem DescriptionThere is a seq

2015-08-01 14:10:28 285

转载方砖问题（动态规划）

Problem A: 方砖问题Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 6 Solved: 2[Submit][Status][Web Board]Description用边长小于N的正方形方砖（注意，不要求所有的方砖大小相同，请看样例说明）不重叠地铺满N*N的正方形房间，最少要几块方砖。可以将n*n的大

2015-07-31 19:17:57 3758 1

转载不要62（数位Dp）

不要62Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 25374 Accepted Submission(s): 8782Problem Description杭州人称那些傻乎乎粘嗒嗒的人为62（音：

2015-07-28 15:01:50 362

转载 Bomb（数位Dp）

BombTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 10373 Accepted Submission(s): 3657Problem DescriptionThe counter-terrori

2015-07-27 17:49:43 474

转载威威猫系列故事——打地鼠(简单Dp填数)

威威猫系列故事——打地鼠Time Limit: 300/100 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 2333 Accepted Submission(s): 1139Problem Description　　威威猫最近不务正业，每天沉

2015-07-27 14:55:00 478

转载 Watch The Movie（严格限制数量的二维费用背包）

Watch The MovieTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 6454 Accepted Submission(s): 2066Problem DescriptionNew semest

2015-07-26 20:00:31 309

转载 FATE(二维费用背包)

FATETime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 9596 Accepted Submission(s): 4516Problem Description最近xhd正在玩一款叫做FATE的游戏，为

2015-07-26 16:58:59 370

转载 Tug of War（严格限制数量的二维费用背包）

Tug of WarTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 8500 Accepted: 2311DescriptionA tug of war is to be arranged at the local office picnic. For t

2015-07-26 15:54:34 646

转载二维费用背包

问题二维费用的背包问题是指：对于每件物品，具有两种不同的费用；选择这件物品必须同时付出这两种代价；对于每种代价都有一个可付出的最大值（背包容量）。问怎样选择物品可以得到最大的价值。设这两种代价分别为代价1和代价2，第i件物品所需的两种代价分别为a[i]和 b[i]。两种代价可付出的最大值（两种背包容量）分别为V和U。物品的价值为w[i]。算法费用加了一维，只需状态也加一维

2015-07-26 15:52:17 1083

转载 Specialized Four-Digit Numbers(进制转换)

Specialized Four-Digit NumbersTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4978 Accepted Submission(s): 3597Problem Descriptio

2015-07-25 20:09:03 437

转载进制转换（进制转换）

进制转换Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 31674 Accepted Submission(s): 17612Problem Description输入一个十进制数N，将它转换成R进制数

2015-07-25 19:07:40 926

转载使用栈实现进制转换（大数进制转换）

Problem A: 使用栈实现进制转换Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 62 Solved: 37[Submit][Status][Web Board]Description使用栈将一个很长（>30）的十进制数转换为二进制数Input若干个很长的十进制数每行一个

2015-07-25 18:37:49 2735

转载 NUMBER BASE CONVERSION（大数进制转换）

NUMBER BASE CONVERSIONTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 4580 Accepted: 2095DescriptionWrite a program to convert numbers in one base to nu

2015-07-25 18:32:59 1023

转载 A计划（bfs）

A计划Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 12734 Accepted Submission(s): 3109Problem Description可怜的公主在一次次被魔王掳走一次次被骑士们

2015-07-25 11:33:38 413

转载采药（01背包）

1753: 采药Time Limit: 0 Sec Memory Limit: 128 MBSubmit: 10 Solved: 8[Submit][Status][Web Board]Description辰辰是个天资聪颖的孩子，他的梦想是成为世界上最伟大的医师。为此，他想拜附近最有威望的医师为师。医师为了判断他的资质，给他出了一个难题。医师把他带到一个到

2015-07-25 10:52:46 542

转载 Tempter of the Bone(DFS+剪枝)

Tempter of the BoneTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 87885 Accepted Submission(s): 23909Problem DescriptionThe

2015-07-24 20:31:25 363

空空如也

空空如也