- html - 出于某种原因,IE8 对我的 Sass 文件中继承的 html5 CSS 不友好?
- JMeter 在响应断言中使用 span 标签的问题
- html - 在 :hover and :active? 上具有不同效果的 CSS 动画
- html - 相对于居中的 html 内容固定的 CSS 重复背景?
我正在为作业编写一个程序,但是当我尝试调整合并排序以处理字符串(按字母顺序排序)时,它会生成看似随机的标题顺序,如下所示。我前段时间问过这个问题,但没有得到真正的答案,所以我觉得我需要更好地表达它并包含我的完整代码。
按标题升序
Titanic, 1997 by Paramount, Marvel's The Avengers, 2012 by Disney Harry Potter and the Deathly Hallows Part 2, 2012 by Warner Brothers Furious 7, 2015 by Universal Avengers: Age of Ultron, 2015 by Disney Avatar, 2009 by Fox Star Wars: The Force Awakens, 2015 by Disney Jurassic World, 2015 by Universal Avengers: Infinity War, 2018 by Disney Black Panther, 2018 by Disney
I have to arrange alphabetically specifically using merge sort that I write myself, and while I have tried all sorts of different configurations of the compareTo statement, like:
else if ((a[j].getTitle()).compareTo(a[i].getTitle()) > 0)
else if ((a[i].getTitle()).compareTo(a[j].getTitle()) < 0)
else if ((a[i].getTitle()).compareTo(a[j].getTitle()) > 0)
它们都不起作用。
/**
* Write a description of class MovieV3Tester here.
*
* @author (your name)
* @version (a version number or a date)
*/
public class MovieV3Tester
{
public static void main(String [] args)
{
MovieV3 [] movies = {new MovieV3 ("Avatar", 2009, "Fox"),
new MovieV3 ("Titanic", 1997, "Paramount"),
new MovieV3 ("Star Wars: The Force Awakens", 2015, "Disney"),
new MovieV3 ("Avengers: Infinity War", 2018, "Disney"),
new MovieV3 ("Jurassic World", 2015, "Universal"),
new MovieV3 ("Marvel's The Avengers", 2012, "Disney"),
new MovieV3 ("Furious 7", 2015, "Universal"),
new MovieV3 ("Avengers: Age of Ultron", 2015, "Disney"),
new MovieV3 ("Black Panther", 2018, "Disney"),
new MovieV3 ("Harry Potter and the Deathly Hallows Part 2", 2012, "Warner Brothers")
};
System.out.println("Original\n");
print(movies);
System.out.println("\nBy Title Ascending\n");
mergeTitle(movies, 0, (movies.length-1));
mergeTitle(movies, 0, (movies.length-1));
print(movies);
System.out.println("\nBy Year Ascending\n");
mergeYear(movies, 0, (movies.length-1));
print(movies);
}
public static void print(MovieV3 [] movies)
{
for(MovieV3 movie : movies)
{
System.out.println(movie.getTitle() + ", " + movie.getYear() + " by " + movie.getStudio());
}
}
public static void merge( MovieV3[] a, int low, int mid, int high, int compare)
{
MovieV3[] temp = new MovieV3[ high - low + 1 ];
int i = low, j = mid + 1, n = 0;
if(compare == 1)
{
while( i <= mid || j <= high )
{
if( i > mid )
{
temp[ n ] = a[ j ];
j++;
}
else if( j > high )
{
temp[ n ] = a[ i ];
i++;
}
else if( a[ i ].getYear() < a[ j ].getYear() )
{
temp[ n ] = a[ i ];
i++;
}
else
{
temp[ n ] = a[ j ];
j++;
}
n++;
}
}
else if(compare ==2)
{
while( i <= mid || j <= high )
{
if( i > mid )
{
temp[ n ] = a[ j ];
j++;
}
else if( j > high )
{
temp[ n ] = a[ i ];
i++;
}
else if((a[ j ].getTitle()).compareTo(a[i].getTitle())< 0)
{
temp[ n ] = a[ i ];
i++;
}
else
{
temp[ n ] = a[ j ];
j++;
}
n++;
}
}
else
{
while( i <= mid || j <= high )
{
if( i > mid )
{
temp[ n ] = a[ j ];
j++;
}
else if( j > high )
{
temp[ n ] = a[ i ];
i++;
}
else if( a[ i ].getYear() < a[ j ].getYear() )
{
temp[ n ] = a[ i ];
i++;
}
else
{
temp[ n ] = a[ j ];
j++;
}
n++;
}
}
for( int k = low ; k <= high ; k++ )
a[ k ] = temp[ k - low ];
} // end of merge
public static void mergeYear(MovieV3[] a, int low, int high)
{
if( low == high )
return;
int mid = ( low + high ) / 2;
mergeYear( a, low, mid ); // recursive call
mergeYear( a, mid + 1, high); // recursive call
//Debugging Statements
//uncomment to print the listings after each pass through the sort
//System.out.println("\nCurrent list");
//for(Movie h : a)
// if( h != null) System.out.printf("$%10.2f \n", h.getCost() );
merge( a, low, mid, high, 1);
}
public static void mergeTitle(MovieV3[] a, int low, int high)
{
if( low == high )
return;
int mid = ( low + high ) / 2;
mergeYear( a, low, mid ); // recursive call
mergeYear( a, mid + 1, high); // recursive call
//Debugging Statements
//uncomment to print the listings after each pass through the sort
//System.out.println("\nCurrent list");
//for(Movie h : a)
// if( h != null) System.out.printf("$%10.2f \n", h.getCost() );
merge( a, low, mid, high, 2);
}
public static MovieV3 [] insertionTitle(MovieV3[] source,int compare)
{
MovieV3[] dest = new MovieV3[ source.length ];
for( int i = 0 ; i < source.length ; i++ )
{
MovieV3 next = source[ i ];
int insertIndex = 0;
int k = i;
while( k > 0 && insertIndex == 0 )
{
if(compare == 1)
{
if( next.getTitle().compareTo( dest[k-1].getTitle() ) > 0 )
{
insertIndex = k;
}
else
{
dest[ k ] = dest[ k - 1 ];
}
}
else
{
if( next.getTitle().compareTo( dest[k-1].getTitle() ) < 0 )
{
insertIndex = k;
}
else
{
dest[ k ] = dest[ k - 1 ];
}
}
k--;
}
dest[ insertIndex ] = next;
//Debugging Statements
//uncomment to print the listings after each pass through the sort
//System.out.println("\nPass # " + i);
//for(MovieV3 h : dest)
// if( h != null) System.out.printf("%-15s \n", h.getCity() );
} // end of for
return dest;
}
}
希望它最终会输出以下内容
Avatar, 2009 by Fox, Avengers: Age of Ultron, 2015 by Disney, Avengers: Infinity War, 2018 by Disney, Black Panther, 2018 by Disney, Furious 7, 2015 by Universal, Harry Potter and the Deathly Hallows Part 2, 2012 by Warner Brothers, Jurassic World, 2015 by Universal, Marvel's The Avengers, 2012 by Disney, Star Wars: The Force Awakens, 2015 by Disney, Titanic, 1997 by Paramount
这个程序对整数进行排序很好,但字符串排序不起作用。
最佳答案
你的大部分程序都是正确的;只有一些小错误。
这是经过细微修复和注释的代码版本:
public class MovieV3Tester
{
public static void main(String[] args)
{
MovieV3[] movies = {
new MovieV3 ("Avatar", 2009, "Fox"),
new MovieV3 ("Titanic", 1997, "Paramount"),
new MovieV3 ("Star Wars: The Force Awakens", 2015, "Disney"),
new MovieV3 ("Avengers: Infinity War", 2018, "Disney"),
new MovieV3 ("Jurassic World", 2015, "Universal"),
new MovieV3 ("Marvel's The Avengers", 2012, "Disney"),
new MovieV3 ("Furious 7", 2015, "Universal"),
new MovieV3 ("Avengers: Age of Ultron", 2015, "Disney"),
new MovieV3 ("Black Panther", 2018, "Disney"),
new MovieV3 ("Harry Potter and the Deathly Hallows Part 2", 2012, "Warner Brothers")
};
System.out.println("Original\n");
print(movies);
System.out.println("\nBy Title Ascending\n");
mergeTitle(movies, 0, (movies.length-1));
// Removed extra unnecessary call to `mergeTitle()`
print(movies);
System.out.println("\nBy Year Ascending\n");
mergeYear(movies, 0, (movies.length-1));
print(movies);
}
public static void print(MovieV3[] movies)
{
for (MovieV3 movie : movies)
{
System.out.println(movie.getTitle() + ", " + movie.getYear() + " by " + movie.getStudio());
}
}
public static void merge(MovieV3[] a, int low, int mid, int high, int compare)
{
MovieV3[] temp = new MovieV3[high - low + 1];
int i = low, j = mid + 1, n = 0;
// Changed from `compare == 1` to this so that the last `else` block could be
// removed, as it was identical to this first block
if (compare != 2)
{
while (i <= mid || j <= high)
{
if (i > mid)
{
temp[n] = a[j];
j++;
}
else if (j > high)
{
temp[n] = a[i];
i++;
}
else if (a[i].getYear() < a[j].getYear())
{
temp[n] = a[i];
i++;
}
else
{
temp[n] = a[j];
j++;
}
n++;
}
}
else if (compare == 2)
{
while (i <= mid || j <= high)
{
if (i > mid)
{
temp[n] = a[j];
j++;
}
else if (j > high)
{
temp[n] = a[i];
i++;
}
// Changed the operator from `<` to `>` so that the titles are printed
// the way you showed in your post
else if ((a[j].getTitle()).compareTo(a[i].getTitle()) > 0)
{
temp[n] = a[i];
i++;
}
else
{
temp[n] = a[j];
j++;
}
n++;
}
}
for (int k = low ; k <= high ; k++)
a[k] = temp[k - low];
} // end of merge
public static void mergeYear(MovieV3[] a, int low, int high)
{
if (low == high)
return;
int mid = (low + high) / 2;
mergeYear(a, low, mid); // recursive call
mergeYear(a, mid + 1, high); // recursive call
merge(a, low, mid, high, 1);
}
public static void mergeTitle(MovieV3[] a, int low, int high)
{
if (low == high)
return;
int mid = (low + high) / 2;
// I'm not sure if it was just a typo but in your code you had called `mergeYear()`
// twice instead of `mergeTitle()`, which was causing the sorting to not work
mergeTitle(a, low, mid); // recursive call
mergeTitle(a, mid + 1, high); // recursive call
merge(a, low, mid, high, 2);
}
}
尽管编辑很小,而且您基本上已经有了正确的代码,但希望这会有所帮助。
关于java - 使用字符串实现时,合并排序会生成任意顺序,我们在Stack Overflow上找到一个类似的问题: https://stackoverflow.com/questions/55996981/
我正在创建一个有效的突变,但我不确定它是否按照我认为的方式工作。但是,我想知道执行顺序是什么? 异步 从上到下同步 同步随机顺序 其他 我想确保在执行插入/更新插入之前从表中删除某些项目。使用以下突变
如何更改规则中的前提顺序? 例如,在伊莎贝尔的自然演绎规则中: mp: ?P ⟶ ?Q ⟹ ?P ⟹ ?Q 我们可以将顺序更改为: ?P ⟹ ?P ⟶ ?Q ⟹ ?Q 我可以用 rev_mp或者定义一
关闭。这个问题需要details or clarity .它目前不接受答案。 想改善这个问题吗?通过 editing this post 添加详细信息并澄清问题. 8年前关闭。 Improve thi
我正在使用 Hibernate 3.2,并使用标准来构建查询。我想为多对一关联添加和“排序”,但我不知道如何做到这一点。 Hibernate 查询最终看起来像这样,我猜: select t1.a, t
我正在开发一个项目,但无法让我的 javascript 按顺序工作。我知道 javascript 可以并行执行任务,因此当您向不响应的服务器发出请求时,它不会被卡住。这有它的优点和缺点。就我而言,这是
在下面的代码中,我认为f1 > f2 > f3是调用顺序,但是仅f1被调用。如何获得依次调用的3个函数? 我已经将以下内容添加到main函数中,它可以按预期工作,但是我想知道是否还有其他确定的方法可以
我有一个如下所示的对象数组: [{ "id": 1, "Size": 90, "Maturity": 24, }, { "id": 2, "S
这是征求意见和要求的请求。我是Docker的新手。 我想要一个用于Python项目的生产和开发容器(可能也进行单元测试)。我的搜索指向多阶段Dockerfile(以及运行它们的多个docker-com
我想知道解决以下问题的有效方法是什么: 假设我在组 1 中有三个字符,在组 2 中有两个字符: group_1 = c("X", "Y", "Z") group_2 = c("A", "B") 显然,
在 Cordova 网站上,您可以看到一长串按字母顺序排列的钩子(Hook)列表,但它们触发和执行的正确顺序是什么? 我正在尝试在构建/编译之前将 cordova.js 脚本添加到 index.htm
我想知道解决以下问题的有效方法是什么: 假设我在组 1 中有三个字符,在组 2 中有两个字符: group_1 = c("X", "Y", "Z") group_2 = c("A", "B") 显然,
这个问题已经有答案了: 奥 git _a (2 个回答) 已关闭 9 年前。 这是我的一个练习的代码, public class RockTest { public static void main(
我使用 HashMap 来存储一些数据,但每当新数据保存到 HashMap 或旧数据移出 HashMap 时,我都需要将其保持升序。但是hashmap本身不支持顺序,我可以使用什么数据结构来支持顺序?
我想创建一个序列,当星期几与函数参数中的日期相同时,它会返回所有年份的结果(例如:自开始日期起,2 月 12 日为星期日的所有年份)。 let myDate (dw:System.DayOfWeek)
我有一个包含许多元素的 Xelement。 我有以下代码来对它们进行排序: var calculation = from y in x.Elements("row")
假设我有: 在 javacript 文件中,我为类按钮和 ID 名称定义了点击操作,例如: $("#name").click(function(event){ alert("hi"); }) $
我有一个包含 2 个 subview 的 View - collectionView 和自定义 View 。我想设置一个操作在布置 2 个 View 后运行,但layoutSubViews 运行了两次
关闭。这个问题需要更多 focused .它目前不接受答案。 想改进这个问题?更新问题,使其仅关注一个问题 editing this post . 2年前关闭。 Improve this questi
我想知道 C++ 中是否有内置方法来比较两个双向迭代器的顺序。例如,我有一个 Sum 函数来计算同一列表中 2 个迭代器之间的总和: double Sum(std::list::const_itera
在 MySQL 中,这两个查询之间有区别吗? SELECT * FROM .... ORDER BY Created,Id DESC 和 SELECT * FROM .... ORDER BY Cre
我是一名优秀的程序员,十分优秀!