B1009的博客

There are two sorted arrays nums1 and nums2 of size m and n respectively.Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).Example 1:nums1 =

You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return i

Given an array of integers, return indices of the two numbers such that they add up to a specific target.You may assume that each input would have exactly one solution, and you may not use the sam

void getNext(string s, vector<int>& next) {    next[0] = 0;    int p_len = s.length();    int i = 1;    int j_len = 0;    for (; i < p_len; i++) {        while (j_len > 0 &...

#include <iostream>#include <vector>using namespace std;void merge(vector<int>& nums, int start, int middle, int end) { int len = end - start; vector<int> temp(len ...