WLSK801的博客

/** * // This is the interface that allows for creating nested lists. * // You should not implement it, or speculate about its implementation * public interface NestedInteger { * // Constructo

public class BucketSort { public static void main(String[] args) { int[] arr = {13,4,5,6,8,9,5,8,96,17,23,1,1}; sort(arr); String output = ""; for (int i:arr) { output += i + ","; }

public class ShellSort { public static void main(String[] args) { int[] arr = {13,4,5,6,8,9,5,8,96,17,23}; sort(arr); String output = ""; for (int i:arr) { output += i + ","; } Syst

最近在复习算法，复习到QuickSort。QuickSort原理很简单。就是将一段序列分成两段，两段的一段大于一个中间值，一段小于那个中间值。然后再用递归的方法不断调用这个分段方法。完成排序。参考了：Robert Sedgewick 的《算法（Algorithm ）》public class QuickSort { public static void main(String[

碰到一个用到了蓄水池算法的题目：http://blog.jobbole.com/42550//** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { val = x;

public class Solution { public List kSmallestPairs(int[] nums1, int[] nums2, int k) { PriorityQueue queue = new PriorityQueuea[0]+a[1]-b[0]-b[1]); List res = new ArrayList<>();

/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */public class Solution {

思路是用一个Boolean array来保存每个元素用过的记录，如果用过，则跳过。处理重复数的时候，先sort，然后如果前一个元素等于后一个元素而且前一个元素已经用过，则跳过后一个元素public class Solution { public List> permuteUnique(int[] nums) { List res = new ArrayLi

public class Solution { public int[] singleNumber(int[] nums) { int xor = 0; for (int num : nums) { xor ^= num; } xor &= -xor;

要是到eft才算。。。。中间的不算的。。。/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } *

public class Solution { public List topKFrequent(int[] nums, int k) { // frequency array List[] freList = new List[nums.length + 1]; // key: value in nums[] value: frequenc

无聊的奇葩题目。。。public class Solution { public int maxCount(int m, int n, int[][] ops) { if (ops == null || ops.length == 0) return m * n; int col = Integer.MAX_VALUE;

public class Solution { public String[] findRestaurant(String[] list1, String[] list2) { int i = 0; i = 0; Map map2 = new HashMap(); for (String ele : list2 ) {

对bit运算实在不了解"&" AND operation, for example, 2 (0010) & 7 (0111) => 2 (0010)"^" XOR operation, for example, 2 (0010) ^ 7 (0111) => 5 (0101)"~" NOT operation, for example, ~2(0010) => -3 (1101)

public class Solution { public boolean detectCapitalUse(String word) { int count = 0; for(char c: word.toCharArray()) if('Z' - c >= 0) count++; return (

奇葩的规则，左子树的规则必须打。/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */public cl

public class Solution { public int distributeCandies(int[] candies) { Arrays.sort(candies); int len = candies.length; int cur = candies[0]; int di

public class Solution { public String[] findWords(String[] words) { List sl = new ArrayList(); Map map = new HashMap<>(); String[] key = {"QWERTYUIOP", "ASDFGHJKL", "ZXCV

public class Solution { public int[][] matrixReshape(int[][] nums, int r, int c) { if (nums == null || nums.length == 0 || r * c != nums.length * nums[0].length) return nums; int[]

public class Solution { public int arrayPairSum(int[] nums) { Arrays.sort(nums); int result = 0; for (int i = 0; i < nums.length; i+=2) { result += nums[i];