2016年05月_ok0011

原创 01背包问题

import java.util.ArrayList;import java.util.Arrays;import java.util.List;public class OneZeroBag { public static class Item{ char name; int weight; int value; publi

2016-05-31 21:59:00 251

原创单链表排序

import java.util.ArrayList;import java.util.List;class ListNode { int val; ListNode next; ListNode(int x) { val = x; }}public class Solution { //快速排序 public ListNode sortList(List

2016-05-30 20:16:37 239

原创求数组中不重复的两个数

import java.util.Arrays;public class Solution { public int[] singleNumber(int[] nums) { int[] result = new int[2]; int res = 0; for(int d : nums){ res ^= d;

2016-05-25 23:01:11 928

原创数组去重

import java.util.Arrays;import java.util.Set;import java.util.TreeSet;public class Solution { public int removeDuplicates1(int[] nums) { if(nums == null || nums.length == 0){

2016-05-25 00:13:57 206

原创全排列-去重复

import java.util.*;public class Solution { private void swap(int[] nums, int i, int j){ int temp = nums[i]; nums[i] = nums[j]; nums[j] = temp; } private void perm2(in

2016-05-22 23:06:36 625

原创二叉搜索数求最近公共祖先

import java.util.ArrayList;import java.util.LinkedList;import java.util.List;import java.util.Stack;class TreeNode { int val; TreeNode left; TreeNode right; TreeNode(int x) {

2016-05-22 19:31:01 223

原创罗马数字转换

import java.util.HashMap;import java.util.Map;public class Solution { public int romanToInt(String s) { Map<Character, Integer> romanMap = new HashMap<>(); romanMap.put('I', 1);

2016-05-22 18:52:20 466

原创判断单链表回文

class ListNode { int val; ListNode next; ListNode(int x) { val = x; }}public class Solution { public boolean isPalindrome(ListNode head) { if(head == null

2016-05-22 18:12:17 337

原创求1到n中1的个数

public class Solution { public int countDigitOne(int n) { long sum = 0; long factor = 1; while(n/factor != 0){ long lower = n%factor; long curr = (n/

2016-05-22 16:18:55 386

原创整数数组按频率和大小排序

import java.util.Arrays;import java.util.Comparator;import java.util.HashMap;import java.util.Map;public class tt { public static void main(String[] args){ //数字排序，按频率由低到高，相同频率按数字大小排序

2016-05-20 22:09:05 1641

原创快速排序找第k大的数

public class findKMax { public static int findKMaxInteger(int array[],int low,int high, int findK){ int i = low; int j = high; int key = array[i]; while(i < j){

2016-05-09 14:55:25 936

原创折半插入排序

import java.util.Arrays;public class BinaryInsertionSort { public static void binaryInsertSort(int[] array){ int i, j, temp, low, high, mid; for(i = 1; i < array.length; i++){

2016-05-09 13:13:43 191

原创直接插入排序

import java.util.Arrays;public class InsertSort { public static void insertSort(int[] array){ int i,j,temp; for(i = 1; i < array.length; i++){ if(array[i] < array[i-1]){

2016-05-09 12:57:24 185

原创二分查找

import java.util.Arrays;public class BinarySearch { public static int binarySearch1(int[] array, int key){ int low = 0; int high = array.length - 1; int mid; while (

2016-05-05 23:38:21 241

ok0011的博客