<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[fyyf168lee的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/fyyf168lee</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; fyyf168lee]]></copyright><item><title><![CDATA[70. 爬楼梯]]></title><link>https://blog.youkuaiyun.com/fyyf168lee/article/details/85114874</link><guid>https://blog.youkuaiyun.com/fyyf168lee/article/details/85114874</guid><author>fyyf168lee</author><pubDate>Thu, 20 Dec 2018 11:28:33 +0800</pubDate><description><![CDATA[//超时

class Solution {
    public int climbStairs(int n) {
         if(n==1) return 1;
        else if(n==2) return 2;
        return climbStairs(n-1)+climbStairs(n-2);
    }
}

//借助数组，对中间结果进行存储

clas...]]></description><category></category></item><item><title><![CDATA[680. 验证回文字符串 Ⅱ]]></title><link>https://blog.youkuaiyun.com/fyyf168lee/article/details/85113640</link><guid>https://blog.youkuaiyun.com/fyyf168lee/article/details/85113640</guid><author>fyyf168lee</author><pubDate>Thu, 20 Dec 2018 11:14:08 +0800</pubDate><description><![CDATA[//超时

class Solution {
    public boolean validPalindrome(String s) {
        int len=s.length();
        if(Palindrome(s)) return true;
        for (int i = 0; i &amp;lt;len ; i++) {
            String t...]]></description><category></category></item><item><title><![CDATA[443. 压缩字符串]]></title><link>https://blog.youkuaiyun.com/fyyf168lee/article/details/85112899</link><guid>https://blog.youkuaiyun.com/fyyf168lee/article/details/85112899</guid><author>fyyf168lee</author><pubDate>Thu, 20 Dec 2018 10:25:09 +0800</pubDate><description><![CDATA[class Solution {
   public int compress(char[] chars) {
        int len = chars.length;
        int count = 0;
        Stack&amp;lt;Character&amp;gt; s = new Stack&amp;lt;&amp;gt;();
        String temp = &quot;&quot;;
       ...]]></description><category></category></item><item><title><![CDATA[414. 第三大的数]]></title><link>https://blog.youkuaiyun.com/fyyf168lee/article/details/85111884</link><guid>https://blog.youkuaiyun.com/fyyf168lee/article/details/85111884</guid><author>fyyf168lee</author><pubDate>Thu, 20 Dec 2018 09:36:42 +0800</pubDate><description><![CDATA[觉得第三个实例是错的呀，按照通过的代码第三大的数并不是唯一出现的 按照唯一出现写的代码不通过，不唯一的就通过了 解释: 注意，要求返回第三大的数，是指第三大且唯一出现的数。 存在两个值为2的数，它们都排第二。

 

 

class Solution {
    public int thirdMax(int[] nums) {
           Arrays.sort(nums);
   ...]]></description><category></category></item><item><title><![CDATA[Leetcode 633. 平方数之和]]></title><link>https://blog.youkuaiyun.com/fyyf168lee/article/details/85109278</link><guid>https://blog.youkuaiyun.com/fyyf168lee/article/details/85109278</guid><author>fyyf168lee</author><pubDate>Wed, 19 Dec 2018 22:19:38 +0800</pubDate><description><![CDATA[class Solution {
    public boolean judgeSquareSum(int c) {
        for (int i = 0; i &amp;lt;=(int)Math.sqrt(c); i++) {
            { int sub=c-i*i;
               if(Math.abs(Math.sqrt(sub)-(int)Math.sq...]]></description><category></category></item><item><title><![CDATA[Leetcode 551. 学生出勤记录 I]]></title><link>https://blog.youkuaiyun.com/fyyf168lee/article/details/85108949</link><guid>https://blog.youkuaiyun.com/fyyf168lee/article/details/85108949</guid><author>fyyf168lee</author><pubDate>Wed, 19 Dec 2018 21:54:18 +0800</pubDate><description><![CDATA[class Solution {
    public boolean checkRecord(String s) {
        int len=s.length();
        int countA=0;
        int countL=0;
        for (int i = 0; i &amp;lt; len; i++) {
            if(s.charAt(i...]]></description><category></category></item><item><title><![CDATA[941 有效的山脉数组]]></title><link>https://blog.youkuaiyun.com/fyyf168lee/article/details/85108614</link><guid>https://blog.youkuaiyun.com/fyyf168lee/article/details/85108614</guid><author>fyyf168lee</author><pubDate>Wed, 19 Dec 2018 21:29:18 +0800</pubDate><description><![CDATA[
import java.util.Arrays;
public class Leecode941{
    public static void main(String[] args) {
        int a[]={14,82,89,84,79,70,70,68,67,66,63,60,58,54,44,43,32,28,26,25,22,15,13,12,10,8,7,5,4,3};
...]]></description><category></category></item><item><title><![CDATA[884. 两句话中的不常见单词]]></title><link>https://blog.youkuaiyun.com/fyyf168lee/article/details/85107786</link><guid>https://blog.youkuaiyun.com/fyyf168lee/article/details/85107786</guid><author>fyyf168lee</author><pubDate>Wed, 19 Dec 2018 20:35:40 +0800</pubDate><description><![CDATA[/*注意这里就可以了：

  map.entrySet()    Map.Entry&amp;lt;E,V&amp;gt;

 for (Map.Entry&amp;lt;String,Integer&amp;gt; entry: Mb.entrySet()) {

*/

 

class Solution {
    public String[] uncommonFromSentences(String A, String...]]></description><category></category></item><item><title><![CDATA[867. 转置矩阵]]></title><link>https://blog.youkuaiyun.com/fyyf168lee/article/details/85107140</link><guid>https://blog.youkuaiyun.com/fyyf168lee/article/details/85107140</guid><author>fyyf168lee</author><pubDate>Wed, 19 Dec 2018 20:05:37 +0800</pubDate><description><![CDATA[class Solution {
    public int[][] transpose(int[][] A) {
        int down=A.length;
        int up=A[0].length;
        int a[][]=new int[up][down];
        for(int i=0;i&amp;lt;down;i++)
            fo...]]></description><category></category></item><item><title><![CDATA[leecode 415. 字符串相加]]></title><link>https://blog.youkuaiyun.com/fyyf168lee/article/details/85098608</link><guid>https://blog.youkuaiyun.com/fyyf168lee/article/details/85098608</guid><author>fyyf168lee</author><pubDate>Wed, 19 Dec 2018 15:40:39 +0800</pubDate><description><![CDATA[class Solution {
    public String addStrings(String num1, String num2) {
        int len1=num1.length();
        int len2=num2.length();
        if(len1&amp;gt;len2) {
            for (int i = 0; i &amp;lt; ...]]></description><category></category></item><item><title><![CDATA[917. 仅仅反转字母]]></title><link>https://blog.youkuaiyun.com/fyyf168lee/article/details/85094271</link><guid>https://blog.youkuaiyun.com/fyyf168lee/article/details/85094271</guid><author>fyyf168lee</author><pubDate>Wed, 19 Dec 2018 13:02:44 +0800</pubDate><description><![CDATA[class Solution {
    public String reverseOnlyLetters(String S) {
        Stack&amp;lt;Character&amp;gt; s=new Stack&amp;lt;Character&amp;gt;();
        int len=S.length();
        for (int i = 0; i &amp;lt;len ; i++) {
...]]></description><category></category></item><item><title><![CDATA[21. 合并两个有序链表]]></title><link>https://blog.youkuaiyun.com/fyyf168lee/article/details/85093977</link><guid>https://blog.youkuaiyun.com/fyyf168lee/article/details/85093977</guid><author>fyyf168lee</author><pubDate>Wed, 19 Dec 2018 12:43:49 +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 mergeTwoLis...]]></description><category></category></item><item><title><![CDATA[Leecode53 最大和子序列]]></title><link>https://blog.youkuaiyun.com/fyyf168lee/article/details/85092238</link><guid>https://blog.youkuaiyun.com/fyyf168lee/article/details/85092238</guid><author>fyyf168lee</author><pubDate>Wed, 19 Dec 2018 12:00:16 +0800</pubDate><description><![CDATA[
///动态规划 dp[i]=Math.max(dp[i-1]+nums[i],nums[i]);挺简单的，下面这个，就是直接输出最大值，但是没有记录下具体数字序列是多少
public class Leecode51 {
    public static void main(String[] args) {
        int a[]={-2,11,-4,13,-5,-2};
       ...]]></description><category></category></item><item><title><![CDATA[leecode7:整数反转]]></title><link>https://blog.youkuaiyun.com/fyyf168lee/article/details/85090886</link><guid>https://blog.youkuaiyun.com/fyyf168lee/article/details/85090886</guid><author>fyyf168lee</author><pubDate>Wed, 19 Dec 2018 10:55:27 +0800</pubDate><description><![CDATA[
class Solution {
    public int reverse(int x) {
        if(x&amp;lt;-2147483648||x&amp;gt;2147483647) return 0;//tips1:范围很重要
        int flag=1;
        if(x&amp;lt;0)
        {flag=-1;x=-1*x;}
        String s...]]></description><category></category></item><item><title><![CDATA[leecode23 合并K个排序链表]]></title><link>https://blog.youkuaiyun.com/fyyf168lee/article/details/85061285</link><guid>https://blog.youkuaiyun.com/fyyf168lee/article/details/85061285</guid><author>fyyf168lee</author><pubDate>Tue, 18 Dec 2018 10:44:23 +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 merge2Li...]]></description><category></category></item><item><title><![CDATA[leecode14. 最长公共前缀]]></title><link>https://blog.youkuaiyun.com/fyyf168lee/article/details/84998344</link><guid>https://blog.youkuaiyun.com/fyyf168lee/article/details/84998344</guid><author>fyyf168lee</author><pubDate>Fri, 14 Dec 2018 10:00:00 +0800</pubDate><description><![CDATA[好久没练leecode,怕自己费了，本来就是渣渣一枚。

思路：step1:找数组里面的最短字符串

           step2:遍历数组里面的所有字符串，看是否是相同的，相同就放入stringbuilder，否则可以返回了

 

最后通过的代码：

class Solution {
    public String longestCommonPrefix(String[] strs) ...]]></description><category></category></item><item><title><![CDATA[lsc问题]]></title><link>https://blog.youkuaiyun.com/fyyf168lee/article/details/82291926</link><guid>https://blog.youkuaiyun.com/fyyf168lee/article/details/82291926</guid><author>fyyf168lee</author><pubDate>Sat, 01 Sep 2018 23:22:21 +0800</pubDate><description><![CDATA[如果一个字符串S是由两个字符串T连接而成,即S = T + T, 我们就称S叫做平方串,例如&quot;&quot;,&quot;aabaab&quot;,&quot;xxxx&quot;都是平方串.
牛牛现在有一个字符串s,请你帮助牛牛从s中移除尽量少的字符,让剩下的字符串是一个平方串。换句话说,就是找出s的最长子序列并且这个子序列构成一个平方串。

输入描述:


输入一个字符串s,字符串长度length(1 ≤ length ≤ 50),字符串只包括...]]></description><category></category></item><item><title><![CDATA[编写程序过程]]></title><link>https://blog.youkuaiyun.com/fyyf168lee/article/details/82252488</link><guid>https://blog.youkuaiyun.com/fyyf168lee/article/details/82252488</guid><author>fyyf168lee</author><pubDate>Fri, 31 Aug 2018 10:30:46 +0800</pubDate><description><![CDATA[ 

给定一个数组序列, 需要求选出一个区间, 使得该区间是所有区间中经过如下计算的值最大的一个：

区间中的最小数 * 区间所有数的和最后程序输出经过计算后的最大值即可，不需要输出具体的区间。如给定序列  [6 2 1]则根据上述公式, 可得到所有可以选定各个区间的计算值:

 

[6] = 6 * 6 = 36;

[2] = 2 * 2 = 4;

[1] = 1 * 1 = 1;

[6...]]></description><category></category></item></channel></rss>