这里面包含了一百多个JAVA源文件

源代码在线查看: e362. inserting an element into a sorted list.txt

软件大小: 551 K
上传用户: maple_78
关键词: JAVA
下载地址: 免注册下载 普通下载 VIP

相关代码

				This example demonstrates how to determine the index at which an element should be inserted into a sorted list. Although binarySearch() is used to locate existent elements, it can also be used to determine the insert index for non-existent elements. Specifically, the insertion index is computed in the following way: insert-index = (-return-value)-1 
				    // Create a list with an ordered list of items
				    List sortedList = new LinkedList();
				    sortedList.addAll(Arrays.asList(new String[]{"ant", "bat", "cat", "dog"}));
				    
				    // Search for the non-existent item
				    int index = Collections.binarySearch(sortedList, "cow");      // -4
				    
				    // Add the non-existent item to the list
				    if (index < 0) {
				        sortedList.add(-index-1, "cow");
				    }
				
							

相关资源