Xander's Wiki


  • Home

  • Tags

  • Categories

  • Archives

  • Search

macOS环境下gtest框架的使用

Posted on 2019-04-02 | In 杂项

本篇主要讲述如何在macOS环境下使用googletest框架。

Read more »

macOS环境gcc配置

Posted on 2019-03-23 | In 杂项

macOS默认C++编译工具为clang,下文将具体描述如何将编译工具改为gcc7.4.0。(截至目前,笔者已更新至gcc8.3.0)

Read more »

vultr科学上网脚本备份

Posted on 2019-03-21 | In 杂项

SSR脚本

 
CentOS6 ,Debian6 ,Ubuntu14 一建部署SSR脚本:

1
2
yum -y install wget
wget -N --no-check-certificate https://raw.githubusercontent.com/hombo125/doubi/master/ssr.sh && chmod +x ssr.sh && bash ssr.sh

BBR加速

 
CentOS 6+,Debian 8+,Ubuntu 14+ BBR加速脚本:

1
wget -N --no-check-certificate "https://raw.githubusercontent.com/chiakge/Linux-NetSpeed/master/tcp.sh" && chmod +x tcp.sh && ./tcp.sh

OJ每日练习(17)

Posted on 2018-08-18 | In OJ Exercises

题目名称

  1. Construct Binary Tree
  2. Unique Binary Search Trees(Leetcode #96)
  3. Validate Binary Search Tree(Leetcode #98)
  4. Convert Sorted Array to Binary Search Tree(Leetcode #108)
  5. Convert Sorted List to Binary Search Tree(Leetcode #109)
  6. Minimum Depth of Binary Tree (Leetcode #111)
  7. Path Sum (Leetcode #112)
  8. Binary Tree Maximum Path Sum (Leetcode #124)
  9. Populating Next Right Pointers in Each Node(Leetcode #116)
  10. Sum Root to Leaf Numbers(Leetcode #129)
Read more »

OJ每日练习(16)

Posted on 2018-08-17 | In OJ Exercises

题目名称

  1. Binary Tree Preorder Traversal(Leetcode #144)
  2. Binary Tree Inorder Traversal(Leetcode #94)
  3. Binary Tree Postorder Traversal(Leetcode #145)
  4. Binary Tree Level Order Traversal(Leetcode #102)
  5. Binary Tree Zigzag Order Traversal(Leetcode #103)
  6. Recover Binary Search Tree (Leetcode #99)
  7. Same Tree (Leetcode #100)
  8. Balanced Binary Tree (Leetcode #110)
  9. Flatten Binary Tree to Linked List(Leetcode #114)
  10. Populating Next Right Pointers in Each NodeⅡ (Leetcode #117)
Read more »

OJ每日练习(15)

Posted on 2018-08-16 | In OJ Exercises

题目名称

  1. Regular Expression Matching(Leetcode #10)
  2. Longest Common Prefix(Leetcode #14)
  3. Valid Number(Leetcode #65)
  4. Integer to Roman(Leetcode #12)
  5. Anagrams(Leetcode #242)
  6. Simplify Path (Leetcode #242)
  7. Length of Last Word (Leetcode #58)
  8. Valid Parentheses (Leetcode #20)
  9. Largest Rectangle in Histogram(Leetcode #84)
  10. Evaluate Reverse Polish Notation (Leetcode #150)
Read more »

OJ每日练习(14)

Posted on 2018-08-15 | In OJ Exercises

(有些题目存在更优解,但留到后期刷leetcode时处理)

题目名称

  1. 求1+2+3+……+n(剑指offer #64)
  2. 不用加减乘除作加法(剑指offer #65)
  3. 构建乘积数组(剑指offer #66)
  4. 把字符串转为整数(剑指offer #67)
  5. 树中两个节点的最低公共祖先(剑指offer #68)
  6. z型打印二叉树(剑指offer #69)
  7. 二叉树的层序遍历(剑指offer #70)
Read more »

OJ每日练习(13)

Posted on 2018-08-14 | In OJ Exercises

题目名称

  1. 二叉搜索树的第k大节点(剑指offer #54)
  2. 二叉树的深度(剑指offer #55)
  3. 数组中数字出现的次数(剑指offer #56)
  4. 和为s的数字(剑指offer #57)
  5. 翻转字符串(剑指offer #58)
  6. 队列的最大值(剑指offer #59)
  7. n个骰子的点数(剑指offer #60)
  8. 扑克牌的顺子(剑指offer #61)
  9. 圆圈中最后剩下的数字(剑指offer #62)
  10. 股票的最大利润(剑指offer #63)
Read more »

OJ每日练习(12)

Posted on 2018-08-13 | In OJ Exercises

(周末两天均在完善Json解析器与生成器,现如今可以腾出手来刷题)

题目名称

  1. 数字序列中某一位的数(剑指offer #44)
  2. 把数组排成最小的数(剑指offer #45)
  3. 把数字翻译成字符串(剑指offer #46)
  4. 礼物的最大价值(剑指offer #47)
  5. 最长不含重复字符的子字符串(剑指offer #48)
  6. 丑数(剑指offer #49)
  7. 第一个只出现一次的字符(剑指offer #50)
  8. 数组中的逆序对(剑指offer #51)
  9. 两个链表的第一个公共节点(剑指offer #52)
  10. 在排序数组中查找数字(剑指offer #53)
Read more »

OJ每日练习(11)

Posted on 2018-08-10 | In OJ Exercises

(今天被JSON解析器的bug拖住了,OJ只刷剑指offer)

题目名称

  1. 序列化二叉树(剑指offer #37)
  2. 数组中出现超过一半的数字(剑指offer #39)
  3. 最小的k个数(剑指offer #40)
  4. 数据流的中位数(剑指offer #41)
  5. 连续子数组的最大和(剑指offer #42)
  6. 1~n整数中1出现的次数(剑指offer #43)
Read more »
<i class="fa fa-angle-left"></i>1…345…27<i class="fa fa-angle-right"></i>

xander.liu

266 posts
11 categories
36 tags
RSS
GitHub E-Mail
© 2024 xander.liu
Powered by Hexo
|
Theme — NexT.Pisces v5.1.4