算法
Moon_xuan
To the Moon.
展开
-
八大排序.
八大排序 插入排序 public static void insertSort(int[] array) { for (int i = 1; i < array.length; i++) { int temp = array[i]; int j = i - 1; for (; j >= 0 && array[j] > temp; j--) { //将大于temp的值整体后移一个单位转载 2021-02-27 14:16:48 · 66 阅读 · 0 评论 -
LeetCode热题hot100
LeetCode热题hot100 两数之和 class Solution { public int[] twoSum(int[] nums, int target) { int n = nums.length; for (int i = 0; i < n; ++i) { for (int j = i + 1; j < n; ++j) { if (nums[i] + nums[j] == t原创 2021-02-10 21:56:46 · 197 阅读 · 0 评论