周烽火的博客

class Solution {public: int reverse(int x) { long n=0; while(x!=0){ n=n*10+x%10; x=x/10; } if(n<INT_MAX&&n>INT_MIN) { return (int)n; } return 0; }};

class Solution {public: string longestPalindrome(string s) { int len = s.length(); if (len < 2) { return s; } int maxn = 1; int idx = 0; vector<vector<int> > dp(len, vector<int>(len)); for (int

暴力解法：class Solution {public: double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2) { vector<int>nums3; for(int i=0;i<nums1.size();i++){ nums3.push_back(nums1[i]); }

给定两个数组，编写一个函数来计算他们的交集。class Solution {public: vector<int> intersect(vector<int>& nums1, vector<int>& nums2) { vector<int> fun; int j=0,k=0; sort(nums1.begin(),nums1.end()); sort(nums2.begi

package 刷题;import java.util.HashMap;import java.util.Map;import java.util.Scanner;public class 最长字串 {public static void main(String[] args) {Answer answer = new Answer();Scanner scanner = new S...