WH30

-

c#制作的移位寄存器，用于模拟C/A码的输出（两位反馈）

dgps_spp

Leetcode-3.-Longest-Substring-Without-Repeating-Characters

MY SOLUTION :Given a string, find the length of the longest substring without repeating characters. Examples: Given "abcabcbb", the answer is "abc", which the length is 3. Given "bbbbb", the answer is "b", with the length of 1. Given "pwwkew", the answer is "wke", with the length of 3. Note that the answer must be a substring, "pwke" is a subsequence and not a substring.

Leetcode-solutions

Leetcode-solutions

my_Snake

Snake-cpp

用C++写的一个简易贪吃蛇

solution-for-leetcode-25.-Reverse-Nodes-in-k-Group

solution for leetcode 25. Reverse Nodes in k-Group

Tank_Battle_Online

Online Tank Battle made with Unity

test

Wh

just try

WH30/dgps_spp

WH30/Leetcode-solutions

Leetcode-solutions

WH30/Snake-cpp

用C++写的一个简易贪吃蛇

WH30/Tank_Battle_Online

Online Tank Battle made with Unity

WH30/-

c#制作的移位寄存器，用于模拟C/A码的输出（两位反馈）

WH30/Leetcode-3.-Longest-Substring-Without-Repeating-Characters

MY SOLUTION :Given a string, find the length of the longest substring without repeating characters. Examples: Given "abcabcbb", the answer is "abc", which the length is 3. Given "bbbbb", the answer is "b", with the length of 1. Given "pwwkew", the answer is "wke", with the length of 3. Note that the answer must be a substring, "pwke" is a subsequence and not a substring.

WH30/my_Snake

WH30/solution-for-leetcode-25.-Reverse-Nodes-in-k-Group

solution for leetcode 25. Reverse Nodes in k-Group

WH30/test

WH30/Wh

just try

WH30/WH30.github.io

hi~