<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[a716121的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/a716121</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; a716121]]></copyright><item><title><![CDATA[工作案例 - python绘制excell表中RSRP列的CDF图]]></title><link>https://blog.youkuaiyun.com/a716121/article/details/145499390</link><guid>https://blog.youkuaiyun.com/a716121/article/details/145499390</guid><author>a716121</author><pubDate>Sat, 08 Feb 2025 08:42:33 +0800</pubDate><description><![CDATA[给出一个表格，用python绘制出某列的CDF图，已附python代码和结果图]]></description><category></category></item><item><title><![CDATA[2021-06-01. 最长回文子串 动态规划]]></title><link>https://blog.youkuaiyun.com/a716121/article/details/117456432</link><guid>https://blog.youkuaiyun.com/a716121/article/details/117456432</guid><author>a716121</author><pubDate>Tue, 01 Jun 2021 22:53:01 +0800</pubDate><description><![CDATA[class Solution {
public:
    string longestPalindrome(string s) {
        vector&lt;vector&lt;int&gt;&gt; dp(s.size(),vector&lt;int&gt;(s.size(),0));
        int res=0;
        int l=0;
        int r=0;
        for(int i=s.size()-1;i&gt;=0;i--){
      ...]]></description><category></category></item><item><title><![CDATA[力扣 15 三数之和]]></title><link>https://blog.youkuaiyun.com/a716121/article/details/116354126</link><guid>https://blog.youkuaiyun.com/a716121/article/details/116354126</guid><author>a716121</author><pubDate>Sun, 02 May 2021 15:39:53 +0800</pubDate><description><![CDATA[class Solution {
public:
    vector&lt;vector&lt;int&gt;&gt; threeSum(vector&lt;int&gt;&amp; nums) {
        vector&lt;vector&lt;int&gt;&gt; res;
        int n=nums.size();
        sort(nums.begin(),nums.end());
        for(int i=0;i&lt;n-2;i++){
      ...]]></description><category></category></item><item><title><![CDATA[力扣 14 最长公共前缀]]></title><link>https://blog.youkuaiyun.com/a716121/article/details/116353537</link><guid>https://blog.youkuaiyun.com/a716121/article/details/116353537</guid><author>a716121</author><pubDate>Sun, 02 May 2021 14:33:30 +0800</pubDate><description><![CDATA[class Solution {
public:
    string longestCommonPrefix(vector&lt;string&gt;&amp; strs) {
        if(strs.size()==0) return "";
        string res="";
        for(int i=0;i&lt;strs[0].size();i++){
            for(int j=1;j&lt;strs.size();j++){
         ...]]></description><category></category></item><item><title><![CDATA[力扣13 罗马数字转整数]]></title><link>https://blog.youkuaiyun.com/a716121/article/details/116352405</link><guid>https://blog.youkuaiyun.com/a716121/article/details/116352405</guid><author>a716121</author><pubDate>Sun, 02 May 2021 13:58:48 +0800</pubDate><description><![CDATA[class Solution {
public:
    int romanToInt(string s) {
        int res=0;
        map&lt;char,int&gt;mp={
            {'I',1},
            {'V',5},
            {'X',10},
            {'L',50},
            {'C',100},
            {'D', 500},
            {...]]></description><category></category></item><item><title><![CDATA[力扣 12 整数转罗马数字]]></title><link>https://blog.youkuaiyun.com/a716121/article/details/116351503</link><guid>https://blog.youkuaiyun.com/a716121/article/details/116351503</guid><author>a716121</author><pubDate>Sun, 02 May 2021 11:02:52 +0800</pubDate><description><![CDATA[class Solution {
public:
    string intToRoman(int num) {
        string res="";
        int nums[]={1000,900,500,400,100,90,50,40,10,9,5,4,1};
        string str[]={"M","CM","D","CD","C","XC","L","XL","X","IX","V","IV","I"};
        int i=0;
        wh...]]></description><category></category></item><item><title><![CDATA[力扣 11 乘最多水的容器 双指针]]></title><link>https://blog.youkuaiyun.com/a716121/article/details/116309312</link><guid>https://blog.youkuaiyun.com/a716121/article/details/116309312</guid><author>a716121</author><pubDate>Fri, 30 Apr 2021 21:01:38 +0800</pubDate><description><![CDATA[class Solution {
public:
    int maxArea(vector&lt;int&gt;&amp; height) {
        int res=0;
        int i=0;
        int j=height.size()-1;
        while(i&lt;j){
            int tmp=(j-i)*min(height[i],height[j]);
            res=max(res,tmp);
       ...]]></description><category></category></item><item><title><![CDATA[力扣 9 回文数]]></title><link>https://blog.youkuaiyun.com/a716121/article/details/116277512</link><guid>https://blog.youkuaiyun.com/a716121/article/details/116277512</guid><author>a716121</author><pubDate>Thu, 29 Apr 2021 21:35:58 +0800</pubDate><description><![CDATA[class Solution {
public:
    bool isPalindrome(int x) {
        if(x&lt;0||(x%10==0&amp;&amp;x!=0)) return false;
        int tmp=x;
        long rev=0;   //整数反转可能溢出，保护一下
        while(x!=0){
            rev=rev*10+x%10;
            x/=10;
        }
   ...]]></description><category></category></item><item><title><![CDATA[力扣 7 整数反转]]></title><link>https://blog.youkuaiyun.com/a716121/article/details/116277025</link><guid>https://blog.youkuaiyun.com/a716121/article/details/116277025</guid><author>a716121</author><pubDate>Thu, 29 Apr 2021 21:04:37 +0800</pubDate><description><![CDATA[class Solution {
public:
    int reverse(int x) {
        int tmp=0;
        while(x!=0){
            if(tmp&gt;INT_MAX/10) return 0;
            if(tmp&lt;INT_MIN/10) return 0;
            tmp=tmp*10+x%10;
            x/=10;
        }
        return tm...]]></description><category></category></item><item><title><![CDATA[力扣 6 Z 字形变换]]></title><link>https://blog.youkuaiyun.com/a716121/article/details/116243321</link><guid>https://blog.youkuaiyun.com/a716121/article/details/116243321</guid><author>a716121</author><pubDate>Wed, 28 Apr 2021 21:06:15 +0800</pubDate><description><![CDATA[class Solution {
public:
    string convert(string s, int numRows) {
        if(numRows==1) return s;
        vector&lt;string&gt; rows(numRows);
        string res;
        int flag=0;
        int i=0;
        for(int k=0;k&lt;s.size();k++){
          ...]]></description><category></category></item><item><title><![CDATA[力扣 5回文字符串]]></title><link>https://blog.youkuaiyun.com/a716121/article/details/116241181</link><guid>https://blog.youkuaiyun.com/a716121/article/details/116241181</guid><author>a716121</author><pubDate>Wed, 28 Apr 2021 19:20:50 +0800</pubDate><description><![CDATA[class Solution {
public:
    string longestPalindrome(string s) {
        int n=s.size();
        if(n&lt;2) return s;
        string res=s.substr(0,1);
        int max_len=1;
        vector&lt;vector&lt;bool&gt;&gt; dp(n,vector&lt;bool&gt;(n,false));
 ...]]></description><category></category></item><item><title><![CDATA[C++ 今日份]]></title><link>https://blog.youkuaiyun.com/a716121/article/details/115077371</link><guid>https://blog.youkuaiyun.com/a716121/article/details/115077371</guid><author>a716121</author><pubDate>Mon, 22 Mar 2021 14:25:47 +0800</pubDate><description><![CDATA[class Solution {
public:
    bool Find(int target, vector&lt;vector&lt;int&gt; &gt; array) {
        int m=array.size(),n=array[0].size();
        if(m==0||n==0) return false;
        int i=0,j=n-1; //右上角开始二分
        while(i&lt;m&amp;&amp;j&gt;=0){
      .]]></description><category></category></item><item><title><![CDATA[2020-09-11]]></title><link>https://blog.youkuaiyun.com/a716121/article/details/108532956</link><guid>https://blog.youkuaiyun.com/a716121/article/details/108532956</guid><author>a716121</author><pubDate>Sun, 04 Oct 2020 21:09:54 +0800</pubDate><description><![CDATA[class Solution {
    public int lengthOfLongestSubstring(String s) {
        if(s.length()==0) return 0;
        HashMap&lt;Character,Integer&gt;mp=new HashMap&lt;&gt;();
        int left=0;
        int res=0;
        for(int i=0;i&lt;s.length();i++)...]]></description><category></category></item><item><title><![CDATA[双指针]]></title><link>https://blog.youkuaiyun.com/a716121/article/details/108835024</link><guid>https://blog.youkuaiyun.com/a716121/article/details/108835024</guid><author>a716121</author><pubDate>Sun, 27 Sep 2020 21:41:53 +0800</pubDate><description><![CDATA[class Solution {
    public String reverseVowels(String s) {
        char[]ch=s.toCharArray();
        String yuan="AEIOUaeiou";
        int i=0,j=s.length()-1;
        while(i&lt;j){
            while(i&lt;j&amp;&amp;yuan.indexOf(ch[i])==-1) i++;
     ...]]></description><category></category></item><item><title><![CDATA[链表队栈堆]]></title><link>https://blog.youkuaiyun.com/a716121/article/details/108686257</link><guid>https://blog.youkuaiyun.com/a716121/article/details/108686257</guid><author>a716121</author><pubDate>Wed, 23 Sep 2020 18:32:01 +0800</pubDate><description><![CDATA[/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    public ListNode reverseList(ListNode head) {
        if(head==null||head.next==n...]]></description><category></category></item><item><title><![CDATA[岛屿问题]]></title><link>https://blog.youkuaiyun.com/a716121/article/details/108516318</link><guid>https://blog.youkuaiyun.com/a716121/article/details/108516318</guid><author>a716121</author><pubDate>Thu, 10 Sep 2020 17:51:35 +0800</pubDate><description><![CDATA[class Solution {
    public int numIslands(char[][] grid) {
        if(grid.length==0||grid[0].length==0) return 0;
        int m=grid.length,n=grid[0].length;
        int cnt=0;
        for(int i=0;i&lt;m;i++){
            for(int j=0;j&lt;n;j++){
 ...]]></description><category></category></item><item><title><![CDATA[动态规划]]></title><link>https://blog.youkuaiyun.com/a716121/article/details/108462616</link><guid>https://blog.youkuaiyun.com/a716121/article/details/108462616</guid><author>a716121</author><pubDate>Wed, 09 Sep 2020 20:58:04 +0800</pubDate><description><![CDATA[class Solution{
    public int climbStairs(int n){
        if(n&lt;=2) return n;
        int []dp=new int[n+1];
        dp[1]=1;
        dp[2]=2;
        for(int i=3;i&lt;=n;i++){
            dp[i]=dp[i-1]+dp[i-2];
        }
        return dp[n];
    }
...]]></description><category></category></item><item><title><![CDATA[贪心]]></title><link>https://blog.youkuaiyun.com/a716121/article/details/108450730</link><guid>https://blog.youkuaiyun.com/a716121/article/details/108450730</guid><author>a716121</author><pubDate>Mon, 07 Sep 2020 21:11:34 +0800</pubDate><description><![CDATA[class Solution {
    public int findContentChildren(int[] g, int[] s) {
        if(g==null||s==null) return 0;
        Arrays.sort(g);
        Arrays.sort(s);
        int i=0,j=0;
        while(i&lt;g.length&amp;&amp;j&lt;s.length){
            if(g[i]&...]]></description><category></category></item><item><title><![CDATA[剑指offer]]></title><link>https://blog.youkuaiyun.com/a716121/article/details/108123928</link><guid>https://blog.youkuaiyun.com/a716121/article/details/108123928</guid><author>a716121</author><pubDate>Mon, 07 Sep 2020 14:50:02 +0800</pubDate><description><![CDATA[sort:
对数组A的0~n-1元素进行升序排序，只要写sort(A,A+n)即可；
对于向量V也一样，sort(v.begin(),v.end())即可。
c/c++中获取字符串长度。有以下函数：size()、sizeof() 、strlen()、str.length();






class Solution {
public:
    int findRepeatNumber(vector&lt;int&gt;&amp; nums) {
        unordered_map&lt;int..]]></description><category></category></item><item><title><![CDATA[华为练手]]></title><link>https://blog.youkuaiyun.com/a716121/article/details/108204900</link><guid>https://blog.youkuaiyun.com/a716121/article/details/108204900</guid><author>a716121</author><pubDate>Mon, 24 Aug 2020 22:07:38 +0800</pubDate><description><![CDATA[int main(){
   string str;
    while(cin&gt;&gt;str){
        for(int i=str.length()-1;i&gt;=0;i--){
            cout&lt;&lt;str[i];
        }
        cout&lt;&lt;endl;
    }
    return 0;
}




int main(){
    char ch[1001];
    while(cin&gt;&gt;ch){
...]]></description><category></category></item></channel></rss>