<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Anrys的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Anrys</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Anrys]]></copyright><item><title><![CDATA[优秀硕士毕业生发言稿]]></title><link>https://blog.youkuaiyun.com/Anrys/article/details/125448534</link><guid>https://blog.youkuaiyun.com/Anrys/article/details/125448534</guid><author>Anrys</author><pubDate>Fri, 24 Jun 2022 16:46:41 +0800</pubDate><description><![CDATA[发言稿]]></description><category></category></item><item><title><![CDATA[java刷题--94二叉树的中序遍历]]></title><link>https://blog.youkuaiyun.com/Anrys/article/details/120375661</link><guid>https://blog.youkuaiyun.com/Anrys/article/details/120375661</guid><author>Anrys</author><pubDate>Sun, 19 Sep 2021 00:22:35 +0800</pubDate><description><![CDATA[java刷题--94二叉树的中序遍历题目代码结果
题目

代码
class Solution {
    public List&lt;Integer&gt; inorderTraversal(TreeNode root) {
        LinkedList&lt;Integer&gt; res = new LinkedList();
        Stack&lt;TreeNode&gt; stack = new Stack();
        while(root != null || !st]]></description><category></category></item><item><title><![CDATA[剑指offer--69 II 二叉树的最近公共祖先]]></title><link>https://blog.youkuaiyun.com/Anrys/article/details/119306376</link><guid>https://blog.youkuaiyun.com/Anrys/article/details/119306376</guid><author>Anrys</author><pubDate>Mon, 02 Aug 2021 00:20:08 +0800</pubDate><description><![CDATA[剑指offer--69 II 二叉树的最近公共祖先题目代码结果
题目

代码
class Solution {
    public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
        if (root == null) return null;
        if (root == p || root == q) return root;
        //两个递归返回的是root！
      ]]></description><category></category></item><item><title><![CDATA[java刷题--433最小基因变化]]></title><link>https://blog.youkuaiyun.com/Anrys/article/details/119283115</link><guid>https://blog.youkuaiyun.com/Anrys/article/details/119283115</guid><author>Anrys</author><pubDate>Sat, 31 Jul 2021 23:27:13 +0800</pubDate><description><![CDATA[java刷题--433最小基因变化题目代码结果
题目

代码
class Solution {
    public int minMutation(String start, String end, String[] bank) {
        HashSet&lt;String&gt; set = new HashSet&lt;&gt;();
        for(String b:bank) set.add(b);  //把bank中的字符都存到set
        if(!set.conta]]></description><category></category></item><item><title><![CDATA[java刷题--190颠倒二进制位]]></title><link>https://blog.youkuaiyun.com/Anrys/article/details/119252080</link><guid>https://blog.youkuaiyun.com/Anrys/article/details/119252080</guid><author>Anrys</author><pubDate>Fri, 30 Jul 2021 17:05:52 +0800</pubDate><description><![CDATA[java刷题--190颠倒二进制位题目代码结果
题目

代码
public class Solution {
    public int reverseBits(int n) {
        int rev = 0;
        for (int i = 0; i &lt; 32 &amp;&amp; n != 0; i++) {
            rev |= (n &amp; 1) &lt;&lt; (31 - i);  //n&amp;1是最后一位，随后是位移31-i位
       ]]></description><category></category></item><item><title><![CDATA[java刷题--231 2的幂]]></title><link>https://blog.youkuaiyun.com/Anrys/article/details/119251937</link><guid>https://blog.youkuaiyun.com/Anrys/article/details/119251937</guid><author>Anrys</author><pubDate>Fri, 30 Jul 2021 17:02:24 +0800</pubDate><description><![CDATA[java刷题--231 2的幂题目代码结果
题目

代码
class Solution {
    public boolean isPowerOfTwo(int n) {
        return n&gt;0 &amp;&amp; (n&amp;(n-1))==0;  //解释一些，2的幂次只有在最高位才是1其余都是0
    }
}

结果


]]></description><category></category></item><item><title><![CDATA[java刷题--338 比特位计数]]></title><link>https://blog.youkuaiyun.com/Anrys/article/details/119251898</link><guid>https://blog.youkuaiyun.com/Anrys/article/details/119251898</guid><author>Anrys</author><pubDate>Fri, 30 Jul 2021 17:01:46 +0800</pubDate><description><![CDATA[java刷题--338 比特位计数题目代码结果
题目

代码
动态规划
class Solution {
    public int[] countBits(int num) {
        int[] res = new int[num + 1];
        res[0] = 0;
        for(int i = 1;i&lt;= num;i++){  
            res[i] = res[i &amp; (i - 1)] + 1; //把最低位1去掉
        }]]></description><category></category></item><item><title><![CDATA[java刷题--36有效的数独]]></title><link>https://blog.youkuaiyun.com/Anrys/article/details/119226096</link><guid>https://blog.youkuaiyun.com/Anrys/article/details/119226096</guid><author>Anrys</author><pubDate>Fri, 30 Jul 2021 01:24:03 +0800</pubDate><description><![CDATA[java刷题--36有效的数独题目代码结果
题目

代码
class Solution {
    public boolean isValidSudoku(char[][] board) {
            Set&lt;Character&gt; rowSet = new HashSet&lt;&gt;();
            Set&lt;Character&gt; colSet = new HashSet&lt;&gt;();
            Set&lt;Character&]]></description><category></category></item><item><title><![CDATA[java刷题--51N皇后]]></title><link>https://blog.youkuaiyun.com/Anrys/article/details/119225293</link><guid>https://blog.youkuaiyun.com/Anrys/article/details/119225293</guid><author>Anrys</author><pubDate>Fri, 30 Jul 2021 00:54:27 +0800</pubDate><description><![CDATA[java刷题--51N皇后题目代码结果
题目

代码
class Solution {
    List&lt;List&lt;String&gt;&gt; res = new ArrayList&lt;&gt;();
    public List&lt;List&lt;String&gt;&gt; solveNQueens(int n) {
        char[][] chessboard = new char[n][n];
        for (char[] c : chessboard) ]]></description><category></category></item><item><title><![CDATA[java刷题--130被围绕的区域]]></title><link>https://blog.youkuaiyun.com/Anrys/article/details/119212971</link><guid>https://blog.youkuaiyun.com/Anrys/article/details/119212971</guid><author>Anrys</author><pubDate>Thu, 29 Jul 2021 15:42:24 +0800</pubDate><description><![CDATA[java刷题--130被围绕的区域题目代码结果
题目

代码
class Solution {
    public void solve(char[][] board) {
        if (board == null || board.length == 0) return;
        int m = board.length;
        int n = board[0].length;
        for (int i = 0; i &lt; m; i++) {
        ]]></description><category></category></item><item><title><![CDATA[java刷题--杨辉三角II]]></title><link>https://blog.youkuaiyun.com/Anrys/article/details/119151560</link><guid>https://blog.youkuaiyun.com/Anrys/article/details/119151560</guid><author>Anrys</author><pubDate>Tue, 27 Jul 2021 19:30:32 +0800</pubDate><description><![CDATA[java刷题--杨辉三角II题目代码结果
题目

代码
可以说是非常简单了
class Solution {
    public List&lt;Integer&gt; getRow(int rowIndex) {
        List&lt;List&lt;Integer&gt;&gt; C = new ArrayList&lt;List&lt;Integer&gt;&gt;();
        for (int i = 0; i &lt;= rowIndex; ++i) {
          ]]></description><category></category></item><item><title><![CDATA[java刷题--118杨辉三角]]></title><link>https://blog.youkuaiyun.com/Anrys/article/details/119151502</link><guid>https://blog.youkuaiyun.com/Anrys/article/details/119151502</guid><author>Anrys</author><pubDate>Tue, 27 Jul 2021 19:27:13 +0800</pubDate><description><![CDATA[java刷题--118杨辉三角题目代码结果
题目

代码
class Solution {
    public List&lt;List&lt;Integer&gt;&gt; generate(int numRows) {
        List&lt;List&lt;Integer&gt;&gt; res = new ArrayList();
        for(int i=0;i&lt;numRows;i++) {
            List&lt;Integer&gt; level = ]]></description><category></category></item><item><title><![CDATA[java刷题--264丑数II]]></title><link>https://blog.youkuaiyun.com/Anrys/article/details/119143916</link><guid>https://blog.youkuaiyun.com/Anrys/article/details/119143916</guid><author>Anrys</author><pubDate>Tue, 27 Jul 2021 14:51:26 +0800</pubDate><description><![CDATA[java刷题--264丑数II题目代码结果
题目

代码
class Solution {
    public int nthUglyNumber(int n) {
        int n2 = 0,n3 = 0,n5 = 0;
        int[] dp = new int[n];
        dp[0] = 1;
        for(int i = 1;i&lt;n;i++){
            dp[i] = Math.min(2*dp[n2],Math.min(3*dp[n]]></description><category></category></item><item><title><![CDATA[剑指offer--38字符串的排列]]></title><link>https://blog.youkuaiyun.com/Anrys/article/details/119120913</link><guid>https://blog.youkuaiyun.com/Anrys/article/details/119120913</guid><author>Anrys</author><pubDate>Mon, 26 Jul 2021 23:33:49 +0800</pubDate><description><![CDATA[剑指offer--38字符串的排列题目代码结果
题目

代码
class Solution {
    public String[] permutation(String s) {
        List&lt;String&gt; list = new ArrayList();
        char[] arr = s.toCharArray();
        StringBuilder sb = new StringBuilder();
        boolean[] visited =]]></description><category></category></item><item><title><![CDATA[剑指offer--31栈的压入、弹出序列]]></title><link>https://blog.youkuaiyun.com/Anrys/article/details/119120210</link><guid>https://blog.youkuaiyun.com/Anrys/article/details/119120210</guid><author>Anrys</author><pubDate>Mon, 26 Jul 2021 22:36:20 +0800</pubDate><description><![CDATA[剑指offer--31栈的压入、弹出序列题目代码结果
题目

代码
class Solution {
    public boolean validateStackSequences(int[] pushed, int[] popped) {
        Deque&lt;Integer&gt; stack = new ArrayDeque&lt;&gt;();
        int j = 0; //索引popped
        for (int i = 0; i &lt; pushed.le]]></description><category></category></item><item><title><![CDATA[剑指offer--40最小的k个数]]></title><link>https://blog.youkuaiyun.com/Anrys/article/details/119117971</link><guid>https://blog.youkuaiyun.com/Anrys/article/details/119117971</guid><author>Anrys</author><pubDate>Mon, 26 Jul 2021 20:40:43 +0800</pubDate><description><![CDATA[剑指offer--40最小的k个数题目代码结果
题目

代码
class Solution {
    public int[] getLeastNumbers(int[] arr, int k) {
        if (k == 0 || arr.length == 0) return new int[0];
        //实现升序排列即头节点是最大的--需要重写一下比较器。
        Queue&lt;Integer&gt; pq = new PriorityQueue&lt;&gt;(]]></description><category></category></item><item><title><![CDATA[剑指offer--35复杂链表的复制]]></title><link>https://blog.youkuaiyun.com/Anrys/article/details/119116753</link><guid>https://blog.youkuaiyun.com/Anrys/article/details/119116753</guid><author>Anrys</author><pubDate>Mon, 26 Jul 2021 19:32:12 +0800</pubDate><description><![CDATA[剑指offer--35复杂链表的复制题目代码结果
题目

代码
class Solution {
    public Node copyRandomList(Node head){
        if(head == null) return null;
        Map&lt;Node,Node&gt; map = new HashMap&lt;&gt;();
        for(Node cur = head; cur != null; cur = cur.next){
         ]]></description><category></category></item><item><title><![CDATA[java刷题--208Trie前缀树]]></title><link>https://blog.youkuaiyun.com/Anrys/article/details/119110744</link><guid>https://blog.youkuaiyun.com/Anrys/article/details/119110744</guid><author>Anrys</author><pubDate>Mon, 26 Jul 2021 15:32:26 +0800</pubDate><description><![CDATA[java刷题--208Trie前缀树题目代码结果
题目
腾讯二面–所以说知识点一定要全

代码
class Trie {
    private Trie[] children;
    private boolean isEnd;
    public Trie() {
        children = new Trie[26];
        isEnd = false;
    }
    public void insert(String word) {
        Trie node =]]></description><category></category></item><item><title><![CDATA[java刷题--91解码方法]]></title><link>https://blog.youkuaiyun.com/Anrys/article/details/119082729</link><guid>https://blog.youkuaiyun.com/Anrys/article/details/119082729</guid><author>Anrys</author><pubDate>Sun, 25 Jul 2021 15:36:56 +0800</pubDate><description><![CDATA[java刷题--91解码方法题目代码结果
题目

代码
class Solution {
    public int numDecodings(String s) {
        int n = s.length();
        int[] f = new int[n+1];
        f[0] = 1;
        for (int i = 1; i &lt;= n; i++) {
            //计算单干情况的累加和
            if (s.charAt(i]]></description><category></category></item><item><title><![CDATA[java刷题--647回文子串]]></title><link>https://blog.youkuaiyun.com/Anrys/article/details/119080380</link><guid>https://blog.youkuaiyun.com/Anrys/article/details/119080380</guid><author>Anrys</author><pubDate>Sun, 25 Jul 2021 12:45:09 +0800</pubDate><description><![CDATA[java刷题--647回文子串题目代码结果
题目

代码
class Solution {
    public int countSubstrings(String s) {
        int n = s.length();
        boolean[][] dp = new boolean[n][n];
        int count=0;
        for(int j=0;j&lt;n;j++) {
            for(int i=0;i&lt;=j;i++) {
 ]]></description><category></category></item></channel></rss>