<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[qq_40717455的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/qq_40717455</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; qq_40717455]]></copyright><item><title><![CDATA[SharedPreferences 存取 json数据]]></title><link>https://blog.youkuaiyun.com/qq_40717455/article/details/125251789</link><guid>https://blog.youkuaiyun.com/qq_40717455/article/details/125251789</guid><author>qq_40717455</author><pubDate>Sun, 12 Jun 2022 23:18:18 +0800</pubDate><description><![CDATA[SharedPreferences，json]]></description><category></category></item><item><title><![CDATA[17.电话号码的字母组合]]></title><link>https://blog.youkuaiyun.com/qq_40717455/article/details/122832395</link><guid>https://blog.youkuaiyun.com/qq_40717455/article/details/122832395</guid><author>qq_40717455</author><pubDate>Tue, 08 Feb 2022 22:28:38 +0800</pubDate><description><![CDATA[class Solution {
    public List&lt;String&gt; letterCombinations(String digits) {
        List&lt;String&gt; result = new ArrayList&lt;&gt;();
        String[] str = {"abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"};
        for (int i=0; i&lt;d.]]></description><category></category></item><item><title><![CDATA[21. 合并俩个有序链表]]></title><link>https://blog.youkuaiyun.com/qq_40717455/article/details/122334945</link><guid>https://blog.youkuaiyun.com/qq_40717455/article/details/122334945</guid><author>qq_40717455</author><pubDate>Thu, 06 Jan 2022 00:13:26 +0800</pubDate><description><![CDATA[class Solution {
    public ListNode mergeTwoLists(ListNode list1, ListNode list2) {
        ListNode cur = new ListNode(0);
        ListNode sum = cur;
        while (list1 != null &amp;&amp; list2 != null) {
            if (list1.val &lt; list2.val) {
 .]]></description><category></category></item><item><title><![CDATA[20. 有效的括号]]></title><link>https://blog.youkuaiyun.com/qq_40717455/article/details/122313375</link><guid>https://blog.youkuaiyun.com/qq_40717455/article/details/122313375</guid><author>qq_40717455</author><pubDate>Tue, 04 Jan 2022 22:39:28 +0800</pubDate><description><![CDATA[class Solution {
    public boolean isValid(String s) {
         while (s.contains("()")||s.contains("{}")||s.contains("[]")){
            s = s.replace("()","");
            s = s.replace("{}","");
            s = s.replace("[]","");
       }
        ret.]]></description><category></category></item><item><title><![CDATA[19. 删除链表的倒数第 N 个结点]]></title><link>https://blog.youkuaiyun.com/qq_40717455/article/details/122032582</link><guid>https://blog.youkuaiyun.com/qq_40717455/article/details/122032582</guid><author>qq_40717455</author><pubDate>Sun, 19 Dec 2021 23:56:52 +0800</pubDate><description><![CDATA[class Solution {
    public ListNode removeNthFromEnd(ListNode head, int n) {
        ListNode fast = head;
        ListNode slow = head;
        for(int i = 0; i &lt; n; i++) {
            fast = fast.next;
        }
        if(fast == null) {
          .]]></description><category></category></item><item><title><![CDATA[15. 三数之和]]></title><link>https://blog.youkuaiyun.com/qq_40717455/article/details/121985304</link><guid>https://blog.youkuaiyun.com/qq_40717455/article/details/121985304</guid><author>qq_40717455</author><pubDate>Thu, 16 Dec 2021 22:21:19 +0800</pubDate><description><![CDATA[class Solution {
    public List&lt;List&lt;Integer&gt;&gt; threeSum(int[] nums) {
        Arrays.sort(nums);
        List&lt;List&lt;Integer&gt;&gt; lists = new ArrayList&lt;&gt;();
        for(int i = 0; i&lt; nums.length; ++i){
            if(nums[i] &.]]></description><category></category></item><item><title><![CDATA[5. 最长回文子串]]></title><link>https://blog.youkuaiyun.com/qq_40717455/article/details/121916888</link><guid>https://blog.youkuaiyun.com/qq_40717455/article/details/121916888</guid><author>qq_40717455</author><pubDate>Mon, 13 Dec 2021 23:32:48 +0800</pubDate><description><![CDATA[class Solution {
   public static String longestPalindrome(String s) {
        if(s.length() == 1){
            return s;
        }
        int right = 0;
        int left = 0;
        int len = 1;
        int maxLen = 0;
        int maxStart = 0;
       .]]></description><category></category></item><item><title><![CDATA[LeetCode - 每日一题 1816. 截断句子]]></title><link>https://blog.youkuaiyun.com/qq_40717455/article/details/121758904</link><guid>https://blog.youkuaiyun.com/qq_40717455/article/details/121758904</guid><author>qq_40717455</author><pubDate>Mon, 06 Dec 2021 23:37:56 +0800</pubDate><description><![CDATA[class Solution {
    public String truncateSentence(String s, int k) {
        int count = 0;
        char[] p = new char[s.length()];
        for(int i = 0;i&lt;s.length();i++){
            if(s.charAt(i) == ' '){
                count++;
            }
 .]]></description><category></category></item><item><title><![CDATA[Android Studio出现Caused by: org.gradle.api.internal.plugins.PluginApplicationException: Failed to app]]></title><link>https://blog.youkuaiyun.com/qq_40717455/article/details/121690332</link><guid>https://blog.youkuaiyun.com/qq_40717455/article/details/121690332</guid><author>qq_40717455</author><pubDate>Fri, 03 Dec 2021 02:16:37 +0800</pubDate><description><![CDATA[解决办法 ：File -&gt; Project Structure -&gt; project 将gradle Version换成最新的即可
]]></description><category></category></item><item><title><![CDATA[Caused by: org.gradle.api.GradleException: The current Gradle version 5.4.1 is not compatible with t]]></title><link>https://blog.youkuaiyun.com/qq_40717455/article/details/121690323</link><guid>https://blog.youkuaiyun.com/qq_40717455/article/details/121690323</guid><author>qq_40717455</author><pubDate>Fri, 03 Dec 2021 02:10:56 +0800</pubDate><description><![CDATA[解决办法 ：File -&gt; Project Structure -&gt; project 将gradle Version换成最新的即可
]]></description><category></category></item><item><title><![CDATA[LeetCode - 每日一题 506. 相对名次]]></title><link>https://blog.youkuaiyun.com/qq_40717455/article/details/121689554</link><guid>https://blog.youkuaiyun.com/qq_40717455/article/details/121689554</guid><author>qq_40717455</author><pubDate>Fri, 03 Dec 2021 00:19:51 +0800</pubDate><description><![CDATA[import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;
class Solution {
    public String[] findRelativeRanks(int[] score) {
        Map&lt;Integer,Integer&gt; hashmap = new HashMap&lt;&gt;();
        String rank[] = new String[score.len.]]></description><category></category></item><item><title><![CDATA[LeetCode - 每日一题 1446. 连续字符]]></title><link>https://blog.youkuaiyun.com/qq_40717455/article/details/121664619</link><guid>https://blog.youkuaiyun.com/qq_40717455/article/details/121664619</guid><author>qq_40717455</author><pubDate>Wed, 01 Dec 2021 21:05:04 +0800</pubDate><description><![CDATA[class Solution {
    public int maxPower(String s) {
        int num = 1, sum = 1;
        for(int i = s.length()-1 ;i &gt;0; i--) {
            char c = s.charAt(i);
            if(c == s.charAt(i - 1)) {
                num++;
            }else {
      .]]></description><category></category></item><item><title><![CDATA[3. 无重复字符的最长子串]]></title><link>https://blog.youkuaiyun.com/qq_40717455/article/details/121622470</link><guid>https://blog.youkuaiyun.com/qq_40717455/article/details/121622470</guid><author>qq_40717455</author><pubDate>Mon, 29 Nov 2021 23:53:38 +0800</pubDate><description><![CDATA[1. class Solution {
2.    public int lengthOfLongestSubstring(String s) {
3.     int left = 0;
4.     int result = 0;
5.     HashMap&lt;Character,Integer&gt; hashMap = new HashMap&lt;Character,Integer&gt; ();
6.     for(int i=0; i&lt;s.length(); i++){
7. .]]></description><category></category></item><item><title><![CDATA[LeetCode - 每日一题 458.可怜的小猪]]></title><link>https://blog.youkuaiyun.com/qq_40717455/article/details/121550091</link><guid>https://blog.youkuaiyun.com/qq_40717455/article/details/121550091</guid><author>qq_40717455</author><pubDate>Thu, 25 Nov 2021 23:30:09 +0800</pubDate><description><![CDATA[class Solution {
    public int poorPigs(int buckets, int minutesToDie, int minutesToTest) {
        int pigs = 0;
        double time = minutesToTest/minutesToDie+1;
        while(buckets &gt; Math.pow(time,pigs)){
            pigs++;
        }
        r.]]></description><category></category></item><item><title><![CDATA[2. 俩数相加]]></title><link>https://blog.youkuaiyun.com/qq_40717455/article/details/121527986</link><guid>https://blog.youkuaiyun.com/qq_40717455/article/details/121527986</guid><author>qq_40717455</author><pubDate>Thu, 25 Nov 2021 00:20:55 +0800</pubDate><description><![CDATA[class Solution {
    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
        ListNode l3 = new ListNode();
        ListNode head = l3;
        int carry = 0;
        while(l1 != null || l2 != null || carry != 0){
            int val1 = l1!=nul...]]></description><category></category></item><item><title><![CDATA[1. 俩数之和]]></title><link>https://blog.youkuaiyun.com/qq_40717455/article/details/121482736</link><guid>https://blog.youkuaiyun.com/qq_40717455/article/details/121482736</guid><author>qq_40717455</author><pubDate>Mon, 22 Nov 2021 23:36:30 +0800</pubDate><description><![CDATA[class Solution {
    public int[] twoSum(int[] nums, int target) {
        if(nums.length &lt;= 1){
            return null;
        }
        int[] result = new int[2];
        for(int j = 0; j&lt; nums.length-1; j++){
        for(int i = nums.length-1; .]]></description><category></category></item><item><title><![CDATA[计算机通信网概论]]></title><link>https://blog.youkuaiyun.com/qq_40717455/article/details/103546066</link><guid>https://blog.youkuaiyun.com/qq_40717455/article/details/103546066</guid><author>qq_40717455</author><pubDate>Sun, 15 Dec 2019 11:39:51 +0800</pubDate><description><![CDATA[一：概论

计算机通信网是计算机的运算和处理功能同通信系统的信息传输功能相结合的产物

1.数据通信


计算机网络最基本功能是信息交换，而数据是信息的表现形式，所以数据通信是计算机通信网其他功能的基础。

一个数据通信系统分为五个部分：①报文 ②数据发送者 ③数据接收者 ④传输媒体 ⑤通信协议


通常我们把网络上的设备成为结点，而任意俩结点间的通信方式有三种：

①：单工（通信是单方向的。一...]]></description><category></category></item><item><title><![CDATA[循环队列]]></title><link>https://blog.youkuaiyun.com/qq_40717455/article/details/84591661</link><guid>https://blog.youkuaiyun.com/qq_40717455/article/details/84591661</guid><author>qq_40717455</author><pubDate>Wed, 28 Nov 2018 20:26:32 +0800</pubDate><description><![CDATA[循环队列和栈的操作基本类似 唯一要注意的点为判满条件（q-rear+1）%MAXSIZE 这里的MAXSIZE是队列开辟的最大空间。
#include &amp;lt;stdio.h&amp;gt;
#include &amp;lt;stdlib.h&amp;gt;
typedef struct{
    int arr[10];
    int front;
    int rear;
}CSeQueue;

CSeQueue...]]></description><category></category></item><item><title><![CDATA[栈的基本操作]]></title><link>https://blog.youkuaiyun.com/qq_40717455/article/details/84591384</link><guid>https://blog.youkuaiyun.com/qq_40717455/article/details/84591384</guid><author>qq_40717455</author><pubDate>Wed, 28 Nov 2018 20:03:09 +0800</pubDate><description><![CDATA[#include &amp;lt;stdio.h&amp;gt;
#include &amp;lt;stdlib.h&amp;gt;
#define MAX 20
typedef struct{
    int arr[MAX];
    int top;
}SeqStack;

SeqStack *Init(SeqStack *s)
{
    s=(SeqStack *)malloc(sizeof(SeqStack));
 ...]]></description><category></category></item><item><title><![CDATA[单链表的创建，查找，插入，删除操作]]></title><link>https://blog.youkuaiyun.com/qq_40717455/article/details/83147620</link><guid>https://blog.youkuaiyun.com/qq_40717455/article/details/83147620</guid><author>qq_40717455</author><pubDate>Thu, 18 Oct 2018 15:35:02 +0800</pubDate><description><![CDATA[#include&amp;lt;stdio.h&amp;gt;
#include&amp;lt;malloc.h&amp;gt;
#include&amp;lt;stdlib.h&amp;gt;
struct node{
    int num;
    struct node *next;
};
struct node *Create()
{
    struct node *head,*p,*q;
    int x,i=2;
    he...]]></description><category></category></item></channel></rss>