Ljunyu的博客

题源链接/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode() {} * ListNode(int val) { this.val = val; } * ListNode(int val, ListNode next) { this.val = val; this.next = next; }.

class Solution { public double findMedianSortedArrays(int[] nums1, int[] nums2) { //简单暴力解法 int m = nums1.length; int n = nums2.length; int[] nums = new int[m + n]; // 定义一个m+n长度数组 // 简单排序 两个有序数组合并一个有序数组 .

栈和队列链表二叉树递归和动态规划字符串大数据和空间限制位运算数组和矩阵————————————————————————————滑动窗口排列区间重叠字典树宽度优先搜索深度优先搜索二分搜索哈希堆并查集贪心数学其它

这里写自定义目录标题TOP100 三数之和TOP100 三数之和/** * Return an array of arrays of size *returnSize. * The sizes of the arrays are returned as *returnColumnSizes array. * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free().