|
w*******y
发帖数: 60932 | 2 Pretty highly rated software on Giveaway of the Day.
Link: Link:
http://www.giveawayoftheday.com/paragon-partition-manger-11-per
From the website:
Giveaway of the Day - Paragon Partition Manager 11 Personal Special Edition
(English Version)
March 23, 2011
Get the original! Paragon Softwares advanced partitioning tools help you
completely control and manage your hard disks!
With growing hard drive capacity, the need to reasonably split up the space
is more important than ever. This easy-to-use pa... 阅读全帖 |
|
g********n
发帖数: 447 | 3 网上找了一个solution是用dp的，可是这里怎么也想不明白，能指点一下吗？谢谢
partition.remove(partition.size() - 1);
为什么每次递归调用后需要把最后一个删掉呢？
谢谢
public ArrayList> partition(String s) {
ArrayList> result = new ArrayList>();
if (s == null || s.length() == 0) {
return result;
}
ArrayList partition = new ArrayList();
addPalindrome(s, 0, partition, result);
return result;
}
private void addPalindrome(String s, int start, ArrayList阅读全帖 |
|
d*2
发帖数: 2053 | 4 MegaSAS controller
RHEL 5.8 x64
among several disk (exact same model and controller):
/proc/partitions
sda
sda1
sda2
sda3
sda4
sdb
sdb1
sdb2
sdb3
sdb4
sdc
sdc1
sdc3
sdd
sdd1
sdd2
sdd3
sdd4
...
Tried to use fdisk to delete existing partitions on sdc and repartition it
to be the same as other disks, command operations all succeeded, but /proc/
partitions content just won't update.
tried:
delete partition, then export/import partition table from other disk
use dd to wipe out the partition table and... 阅读全帖 |
|
s**********o
发帖数: 14359 | 5 比如，把浏览网页的记录做成PARTITION TABLE，时间，IP,看了啥是一个记录
按照年份或者月份做PARTITION比如2015年的一个FILEGROOUP, 2014年的一个
FILEGROOUP，2013，2012，2011等等。现在你说删掉一半，一般就是按照年份删吧，把
2011 2012年的删掉，把FILEGROUP去掉就行了。但你要说，把IP是102.-190。的全部删
掉，那只能去TABLE上删掉，跟PARTITION就没啥关系了，INDEX 就DBCC REINDEX一下就
得了。PARTITION的目的就是为了BACKUP容易，查询起来容易。你要DROP PARTITION就
说明你的PARTITION建的目的不对，没弄好，一般都不会去删东西。TABLE PARTITION
针对的都是海量数据，比如色情网站一天的浏览量就上亿，要存个几年的数据就会
巨大无比，按时间PARTITION，历史数据一般也不会去删除。 |
|
w*******y
发帖数: 60932 | 6 Link:
http://iway.org/9569811
product web page for more info - Link:
http://iway.org/9569821
quote
As Partition Magic alternative, EaseUS Partition Master Professional
Edition is an ALL-IN-ONE partition solution and disk management utility. It
allows you to extend partition, especially for system drive, settle low
disk space problem, manage disk space easily on MBR and GUID partition table
(GPT) disk under 32 bit and 64 bit Windows 2000/XP/Vista/Windows 7 ... 阅读全帖 |
|
r*****3
发帖数: 143 | 7 【档案名称】﹕EASEUS Partition Master 9.1 Pro
【软体语言】﹕英文
【软体分类】：磁碟工具
【软体格式】：RAR
【档案大小】：80MB
【放置空间】：DF
【解压密码】：无
【下载点】：
http://depositfiles.com/files/ny343clth
【软体说明】：
Windows 内建的磁碟管理功能，虽然可以分割硬碟、建立或删除磁碟区，不过它却不能
调整现有磁碟区的大小。若要调整磁碟区大小，唯有删除磁碟区再重新建立一途。
EaseUS Partition Master，基本功能和内建功能是差不多的，但它可以让我们在保有
资料的情况之下，调整各磁碟区的大小。
Windows 作业系统内建的磁碟管理功能，可以让我们方便地执行分割硬碟、建立或删除
磁碟区或格式化……等动作。
不过，内建的磁碟管理功能，却没有办法让我们调整已存在且具有资料的磁碟区大小，
这意谓着我们一开始在规划硬碟时，可能就要先好好地思考一下，各磁碟区将来的用途
。否则，日後若发现磁碟区太小，不敷使用时，唯有先行备份资料，删除现有磁碟区再
重新分割一途了！
虽然内建的功能，没有... 阅读全帖 |
|
u*****n
发帖数: 160 | 8 Given a group G, and two subgroups G_1 and G_2, we know that the collection
of cosets of G_1 (G_2) partitions G. Now consider a partition $\Pi$ of G is
coarser than both the coset partitions of G_1 and G_2. By "coarser", we mean
every coset of G_1 (G_2) is contained in one of the part of $\Pi$.
I have the following conjecture that any partition $\Pi$ coarser than both
the coset partitions of G_1 and G_2 must be coarser than the coset partition
of the subgroup generated from the union of G_1 and |
|
|
H*****l
发帖数: 1257 | 10 原题是Leetcode上的Palindrome Partitioning
如下：
Given a string s, partition s such that every substring of the partition is
a palindrome.
Return all possible palindrome partitioning of s.
For example, given s = "aab",
Return
[
["aa","b"],
["a","a","b"]
]
--------------------------------------------------------
请问，dfs函数里，这一小段是什么用处啊？特别是最后的remove..
for(int i=start+1;i<=s.length();i++){
if(isPalin(s,start,i-1)){
al.add(s.substring(start,i));
d... 阅读全帖 |
|
l*********8
发帖数: 4642 | 11 考虑partition生成的二叉树。 如果加上编码：partition在左边的，标记为0，
partition在右边的，标记为1， 那么就是一颗编码树。 每个元素是均等的， 所以每
次partition分成尽可能相等的两份，得到的是Huffman tree, 编码总长度是最优的，
也就是partition的总比较次数是最少的。 |
|
H*****l
发帖数: 1257 | 12 原题是Leetcode上的Palindrome Partitioning
如下：
Given a string s, partition s such that every substring of the partition is
a palindrome.
Return all possible palindrome partitioning of s.
For example, given s = "aab",
Return
[
["aa","b"],
["a","a","b"]
]
--------------------------------------------------------
请问，dfs函数里，这一小段是什么用处啊？特别是最后的remove..
for(int i=start+1;i<=s.length();i++){
if(isPalin(s,start,i-1)){
al.add(s.substring(start,i));
d... 阅读全帖 |
|
o*******8
发帖数: 249 | 13 如果在数据仓库里需要建个新的 partition表，数据从别的表导过来，大概有10B 的
行。
1, 是先load data到空白的没有partition的表，然后 partition，然后index。
2, 还是先建一个有partition的表，然后load data，然后index。
partition是在日期列上。
哪个方法快？谢谢。 |
|
s****e
发帖数: 68 | 14 Hi, I have a desktop which I installed two systems: Windows Vista and Ubunto
. In Windows it has 3 partitions: 400G for system, and 2 800G for storing.
Last couple days, the windows system start to crash, extremely slow, and
pretty much not usable. so I tried to reinstall a Windows 7 there... however
installation disk keep complain about the partition and cannot install to
it. I searched online and someone suggest to use DISKPART (during
installation) to select that disk, then do clean, convert ... 阅读全帖 |
|
w*******y
发帖数: 60932 | 15 Giveaway of the day
linky:
http://www.giveawayoftheday.com/easeus-partition-master-pro-601/
EASEUS Partition Master Professional Edition is an ALL-IN-ONE partition
solution and disk management utility. It allows you to extend partition,
especially for system drive, settle low disk space problem, manage disk
space easily on MBR and GUID partition table (GPT) disk under Windows 2000/
XP/ Vista/ Windows 7 (both x32 and x64).
The most popular hard disk management functions are brought together with |
|
l*********8
发帖数: 4642 | 16 本质。。。
排序的本质是消除序列的熵，熵为0就排好序了。
一个未排序数组的熵是: log(N!)
partition 为一半一半， 熵是log( (N/2)! * (N/2)! )
partition 为1/3, 2/3, 熵是log( (N/3)! * (2N/3)! )
因为 (N/2)! * (N/2)! < (N/3)! * (2N/3)!
所以，partition 为一半一半的熵更小。
所以，partition 为一半一半， 减少的熵更多，是更好的方法。 |
|
a***e
发帖数: 413 | 17 Given a string s, partition s such that every substring of the partition is
a palindrome.
Return the minimum cuts needed for a palindrome partitioning of s.
For example, given s = "aab",
Return 1 since the palindrome partitioning ["aa","b"] could be produced
using 1 cut.
我刚开始看DP，大概有点idea，但怎么都做不对。有同学知道下面这个double loop 到
底怎么错了吗？有什么好的学习DP的方法分享吗？多谢！
class Solution {
public:
int minCut(string s) {
int n=s.size();
if (n<=1) return 0;
vector> b(n, vector<... 阅读全帖 |
|
n******r
发帖数: 1247 | 18 看了说明
下面两句不太懂
Required
The partitions have to be formatted to FAT. Mark the partition you
want to use for WBFS as Active.
If you make multiple partitions, the First partition must be the one for
image,... and the second one for WBFS (for Wii games)
把dirve format成fat，分成两个区没问题，他说第二个去要WBFS，这个怎么format？
WBFSmanager可以format吗？ |
|
B********r
发帖数: 397 | 19 最近弄cassandra,发现里面有个limit:
The maximum number of cells (rows x columns) in a single partition is 2
billion
链接: http://wiki.apache.org/cassandra/CassandraLimitations
其中让我疑惑的是partition这个概念,是说每个node里面可以有好几个partition么?
它是可以configure on the fly, 还是一开是设置就定死了的? 也就是说,如果我一开
是只有 1 partition per node, 当我的cells 超过2 billion就放不下了么? |
|
b*****g
发帖数: 20 | 20 【 以下文字转载自 Hardware 讨论区 】
发信人: bigking (bigking), 信区: Hardware
标 题: 求助! 外接硬盘被partition ，孩子照片都没了
发信站: BBS 未名空间站 (Thu Jan 31 11:04:39 2008)
因电脑染毒，辈份了所有照片，存在USB外接硬盘上，partition 电脑的硬盘时，不小
心同时partition 了外接硬盘。请问有人知道如何recovery被partitioned的硬盘，同
时恢复文件吗，跪谢 |
|
o***z
发帖数: 133 | 21 from fdisk in my freebsd, the output is like
Information from DOS bootblock is:
The data for partition 1 is:
sysid 11,(DOS or Windows 95 with 32 bit FAT)
...
The data for partition 2 is:
sysid 15,(Extended DOS, LBA)
...
The data for partition 3 is:
sysid 165,(FreeBSD/NetBSD/386BSD)
...
so you can only see partition 1? |
|
J*******3
发帖数: 1651 | 22 如何更新recovery partition？
现在一般笔记本电脑都不给系统安装盘，而是用recovery partition来恢复出厂时的软
件配置。
原来recovery partition是老版本的Windows8，现在自己把系统升级到Windows8.1
update。如何如何更新硬盘隐含的recovery partition到最近的Windows8.1 update？
3X! |
|
J*******3
发帖数: 1651 | 23 如何更新recovery partition？
现在一般笔记本电脑都不给系统安装盘，而是用recovery partition来恢复出厂时的软
件配置。
原来recovery partition是老版本的Windows8，现在自己把系统升级到Windows8.1
update。如何如何更新硬盘隐含的recovery partition到最近的Windows8.1 update？
3X! |
|
D**u
发帖数: 204 | 24 The R^3 analogue of Hopf fi bration is indeed surprising.
Here is my thoughts on the new question "how to partition R^3 into pairwise
non-parallel lines?".
We know that the hyperboloid of one sheet
(x^2/a^2 + y^2/b^2 - z^2/c^2 = 1)
can be partitioned with pairwise non-parallel lines.
If we partition R^3 into hyperboliods
x^2/a^2 + y^2/a^2 - z^2 = 1 (0
PLUS the z-axis,
and then partition each hyperboliod with line, then these lines should be
pairwise non-parallel. |
|
j****t
发帖数: 2996 | 25 you sure there is a recovery partition?
if the index was changed or partition was redistributed before, the system
can't find the recovery partition no matter which key you pressed
btw, some model may have a specific hot key, refer to your manual |
|
r**u
发帖数: 1567 | 26 Given a string s, partition s such that every substring of the partition is
a palindrome.
Return all possible palindrome partitioning of s.
For example, given s = "aab",
Return
[
["aa","b"],
["a","a","b"]
]
DFS就是要枚举所有可能的划分，然后检查是否是palindrome吧，中间如果发现划分不
满足palindrome了，就backtrack。这个复杂度应该怎么求？ |
|
h**o
发帖数: 548 | 27 Given a string s, partition s such that every substring of the partition is
a palindrome. Return all possible palindrome partitioning of s.
For example, given s = "aab", Return
[
["aa","b"],
["a","a","b"]
]
知道是用backtracking + DP. 但只知道判断是否Palindrome 可以DP. 不知道为何有贴
说有两个地方可以DP？
复杂度如何求？
time: 每个node 分成 n 支， 有n 层树， 难道 是 time = n^n?
space: n (recursive)+ n^2 (存 isPalindrome 的结果） = n^2? |
|
h**o
发帖数: 548 | 28 Given a string s, partition s such that every substring of the partition is
a palindrome. Return all possible palindrome partitioning of s.
For example, given s = "aab", Return
[
["aa","b"],
["a","a","b"]
]
知道是用backtracking + DP. 但只知道判断是否Palindrome 可以DP. 不知道为何有贴
说有两个地方可以DP？
复杂度如何求？
time: 每个node 分成 n 支， 有n 层树， 难道 是 time = n^n?
space: n (recursive)+ n^2 (存 isPalindrome 的结果） = n^2? |
|
a**********0
发帖数: 422 | 29 数据很大 原先table的schema是根据美国的城市来做partition 现在要求变化了 需要
根据日期做partition
能否在原先的table上直接repartition呢 我能想到的一个方法是建立新的schema然后
把旧的table select到新的table中 但是有什么方法可以直接在原来旧的table上re
partition呢 |
|
S**********y
发帖数: 101 | 30 I installed windows xp to a mac mini using boot camp. After using the
following link to get rid of the error, I cannot access the mac partition
through windows. I am not sure that error is related or not.
Now the problem is when I click the mac partition, is says "the disk in
drive F is not formatted, do you want to format it now?"
I can still read the xp partition through os x, but the left click of the
mouse cannot open any folders, have to right click and select "open".
any suggestions? thank |
|
l******8
发帖数: 4133 | 31 准备用bootcamp装windows，结果第一步就出现了问题，不能partition，我就打电话给
apple support，结果说电脑买了好几年了，要support电话每小时49刀，吐血～～
（btw，partition的时候，我电脑就160g，想给xp 留32g，大家觉得够运行吗？也可以
选5g，不过是不是太少了，用windows会不会太慢阿？）
不能分区时，错误信息是这样提示的：
The disk cannot be partitioned because some files cannot be moved
Back up the disk and use Disk Utility to format it as a single Mac OS
Extended (Journaled) volume. Restore your information to the disk and try
using Boot Camp Assistant again.
咋弄呢？谢谢xdjms！ |
|
|
I*********t
发帖数: 149 | 33 大家好，我是Linux的新手，完全刚开始接触的那种。我的电脑是T42预装XinXP的，昨
天我用Partition Magic 8在硬盘的后面腾出了30GB，计划了大约17GB给/，100MB给/
boot，100MB给/tmp，1GB给SWAP，10GB给/home。再用Debian网上下载的180MB光盘安装
了。安装过程中那个分区程序我设了那些mount点，让它重新格式化了。装完后双系统
启动也都正常。就是再运行Partition Magic 8提示错误，说LBA和CHR值不一致，我都
点了修复。现在是Win下运行Partition Magic提示117错误，程序打不开。DOS下运行提
示114错误，硬盘分区表出错。这样有没有问题？如何解决？
谢谢！ |
|
N****w
发帖数: 21578 | 34 safe to use windows 7 to reduce partition size
then can create new partition |
|
i***0
发帖数: 37 | 35 【 以下文字转载自 JobHunting 讨论区 】
发信人: iq300 (iq300), 信区: JobHunting
标 题: Partitioning
发信站: BBS 未名空间站 (Wed Mar 5 17:27:35 2008)
Partitioning
Given an array of balls, which can be one of two colors (RED or BLUE), write
a function that partitions the array in-place such that on exit from the
function all the balls of the same color are contiguous. It does not matter
whether the red or blue balls come first. The return value from the function
is the index of the first ball of the second color. If there |
|
p*****2
发帖数: 21240 | 36
,
我感觉现在都不叫CF了，叫table了。
我的理解多少个node就多少个partition。
All data for a single partition must fit (on disk) on a single machine in
the cluster. Because partition keys alone are used to determine the nodes
responsible for replicating their data, the amount of data associated with a
single key has this upper bound. |
|
w**z
发帖数: 8232 | 37 one physical node can hold multiple partitions data. one partition is
calculated by the partitioner, the others are the replicates. if RF =1, one
node, one partition. |
|
a**e
发帖数: 5794 | 38 以前一直用PowerQuest Partition Magic（被Symantec收购后改名为
Norton Partition Magic），但是它不能在Vista下用。于是试了以下
两种。
Parogon Partition Manager，发现它移动或改变分区大小时会把后面
一个分区给变成raw，试了两次都是如此。这样太危险了
Acronis Disk Director，不能操作系统分区。有时它要求重启，但是
紧接着又说没有重启的权限，虽然我用admin账户；有时它装模做样地
在移动数据，几分钟后说error，于是又回去了。
企图启动到DOS接着用PqMagic，但是它不认识160G的大硬盘。 |
|
l****e
发帖数: 137 | 39 I just installed a second hard drive for my boss
but it has a great problem in partition.
My boss's first hard drive is 8 G, with C,D,E,F
one month ago, I helped him installed Red Hat in E,
so in windows it becomes C,D, E(F becomes E)
Now he bought 40G MaxtorDiamond40plus. After installation
I used the software which comes with the hard drive
MaxBlast and create 4 partitions, it shows as D,G,H,I
But when I opened windows I saw C,D,E,F,G,H,I,J,
there is one EXTRA partition, and you can never open |
|
n*****n
发帖数: 97 | 40 actually similar questions have been asked several times here.
if only 98 and win2k, solution is quite standard, no need to do
any special treatment, like set active partition when booting,
two primary, hidden partition, etc..
just partition it as you usually do for any win98 installation, install
win98, then win2k over it. win2k can be in any logical volume, but its
loader will be in C: anyway. NT loader will take over win98's boot sector.
Installing 98 over a existing win2k need a little mor |
|
a*****a
发帖数: 15 | 41 You can restore the partitions via a tool in windows 2000 disc.
you can see a folder named support under the windows 2000 install
disc, install the support tool. there will be a tool named diskprobe.exe
under the program files\support tool\
you can use the tool to restore your MBR of the disk
MBR is the master boot record. there is space for 4 partition table.
you can refer to this link of how to restore the partitions:
under "drives" menu choose "physical drive" double click the harddisk0
the B |
|
D****g
发帖数: 2860 | 42 no. just use disk manager from winxp. if you don't do things like
shrinking a partition, combining partitions, moving partitions, it will
suffice. |
|
S***M
发帖数: 140 | 43 I just bought a compaq pc with 160GB harddisk. it already has two partition. C
and D(for recovery), I tried to use partition magic 7.0 to partition C, so I
can install some other OS like XP professional or LINUX. but it wont allow me
to do that. after apply the change, it did not work and back to normal.
Is anybody be kind enough to tell me how to solve this problem.
Thanks |
|
g****c
发帖数: 299 | 44 the problem is recovery partition was assign as D, how could you partition C.
try to use pm 8.0 or delete D partition.
if install linux, have to delete D anyway.
C
I
me |
|
p*******y
发帖数: 133 | 45 Just bought a Dell laptop. Wanted to repartition the harddrive.
I found the harddrive was prepartitioned to have a small partition at the
beginning, 5x MB, a small partiton in the end for about 7MB, and a 3.6 GB
partition labeled P/M concurrent DOS .. What is this thing? Does it matter if
I delete this partition?
Thanks a lot |
|
e*******s
发帖数: 1363 | 46 D: 10g, copy to external drive.
delete partition d:
extend partition c: i.e., 30g
create partition d: i.e., 50-30+10=30g
copy your stuff back to d: |
|
x******r
发帖数: 367 | 47 I would like to get some application examples of complex matrices partitions.
An example of complex matrices partitions is as follows.
A C*C matrix is subdivided inito submatrices of size A and these submatrices
are further subdivided until the subdivision stops after several steps.
Is it possible for you to give me some real application examples of these
complex matrices partitions?
The application examples can come from either other branches of mathematics or
science/engineering.
Thanks for yo |
|
|
r******g
发帖数: 13 | 49 3 way partition first puts the duplicated elements in two ends by scanning
once:
1. moving from let to find element not less < p
2. moving from right to find element not greater > p
3. exchange left and right elemnt
4. if (left elment == p) swap it with left end
5. if (right element == p) swap it with right end
=pivot, p, = pivot
my code got
5, 5, 5, 4, 3, 1, 2, 3, 5, 10, 5, 9
put the duplicated elements in the center by exchanging elements in two ends
and those in the center
3, 2, 1, 4, ... 阅读全帖 |
|
x****3
发帖数: 62 | 50 http://www.careercup.com/question?id=3190687
How do you partition an array into 2 parts such that the two parts have
equal average?...each partition may contain elements that are non-contiguous
in the array.
老看到这道题， 一直想不出比较简洁的解法。能想到的就是穷举所有的subset，计算
比较。 |
|
