摘要：
自然码双拼快速记忆方案 1.zh ch sh zh——v像树枝 ch——i像尺子 sh——u像试管 举例： uu vi——树枝 ii zi——尺子 ui gr——试管 2.三个故事记住双拼 故事1: 分行追贼来求警，靠您 ff hh vv zz ll qq jj kk nn fen hang zhu 阅读全文
摘要：
只需在终端内输入以下命令即可： defaults write com.apple.inputmethod.CoreChineseEngineFramework shuangpinLayout 5 系统为macOS Catalina 10.15.2 参考博客：https://www.dazhuanla 阅读全文
摘要：
An inorder binary tree traversal can be implemented in a non-recursive way with a stack. For example, suppose that when a 6-node binary tree (with the 阅读全文
摘要：
Given two strings S1 and S2, S=S1−S2 is defined to be the remaining string after taking all the characters in S2 from S1. Your task 阅读全文
摘要：
Notice that the number 123456789 is a 9-digit number consisting exactly the numbers from 1 to 9, with no duplication. Double it we will obtain 2469135 阅读全文
摘要：
Given a string, you are supposed to output the length of the longest symmetric sub-string. For example, given Is PAT&TAP symmetric?, the longest symme 阅读全文