DSCSharp:C＃中的数据结构-源码

[{"title":"（ 37 个子文件 33KB ） DSCSharp:C＃中的数据结构-源码","children":[{"title":"DSCSharp-master","children":[{"title":".gitignore <span style='color:#111;'> 934B </span>","children":null,"spread":false},{"title":"DSA.sln <span style='color:#111;'> 2.75KB </span>","children":null,"spread":false},{"title":"README.md <span style='color:#111;'> 391B </span>","children":null,"spread":false},{"title":"DataStructures","children":[{"title":"Extensions","children":[{"title":"GenericExtensions.cs <span style='color:#111;'> 1.01KB </span>","children":null,"spread":false}],"spread":true},{"title":"Entities","children":[{"title":"LinkedListNode.cs <span style='color:#111;'> 662B </span>","children":null,"spread":false},{"title":"BinaryTreeNode.cs <span style='color:#111;'> 724B </span>","children":null,"spread":false},{"title":"Stack.cs <span style='color:#111;'> 606B </span>","children":null,"spread":false},{"title":"DoublyLinkedListNode.cs <span style='color:#111;'> 657B </span>","children":null,"spread":false}],"spread":true},{"title":"ADT","children":[{"title":"StackStaticLength.cs <span style='color:#111;'> 2.12KB </span>","children":null,"spread":false},{"title":"DoublyLinkedList.cs <span style='color:#111;'> 1.77KB </span>","children":null,"spread":false},{"title":"StackRepeatedDouble.cs <span style='color:#111;'> 2.18KB </span>","children":null,"spread":false},{"title":"BinaryTree.cs <span style='color:#111;'> 11.96KB </span>","children":null,"spread":false},{"title":"QueueUsingLL.cs <span style='color:#111;'> 1.51KB </span>","children":null,"spread":false},{"title":"StackUsingLL.cs <span style='color:#111;'> 1.92KB </span>","children":null,"spread":false},{"title":"LinkedList.cs <span style='color:#111;'> 5.17KB </span>","children":null,"spread":false}],"spread":true},{"title":"DataStructures.csproj <span style='color:#111;'> 269B </span>","children":null,"spread":false}],"spread":true},{"title":"Algorithms","children":[{"title":"Algorithms.csproj <span style='color:#111;'> 589B </span>","children":null,"spread":false},{"title":"LeetCode","children":[{"title":"Trees","children":[{"title":"1448_GoodNodes.cs <span style='color:#111;'> 2.04KB </span>","children":null,"spread":false}],"spread":true},{"title":"Strings","children":[{"title":"125_IsPalindrome.cs <span style='color:#111;'> 4.89KB </span>","children":null,"spread":false},{"title":"Palindrome.cs <span style='color:#111;'> 3.37KB </span>","children":null,"spread":false},{"title":"1239_MaxLength.cs <span style='color:#111;'> 977B </span>","children":null,"spread":false},{"title":"1647_MinDeletions.cs <span style='color:#111;'> 4.10KB </span>","children":null,"spread":false},{"title":"LargestK.cs <span style='color:#111;'> 1.42KB </span>","children":null,"spread":false}],"spread":true},{"title":"Arrays","children":[{"title":"121_BuySellStock.cs <span style='color:#111;'> 2.82KB </span>","children":null,"spread":false},{"title":"1304_UniqueIntegerSumtoZero.cs <span style='color:#111;'> 2.80KB </span>","children":null,"spread":false}],"spread":true}],"spread":true},{"title":"HackerRank","children":[{"title":"Stacks","children":[{"title":"BracketMatching.cs <span style='color:#111;'> 3.85KB </span>","children":null,"spread":false},{"title":"EqualStacks.cs <span style='color:#111;'> 2.68KB </span>","children":null,"spread":false},{"title":"MaxInStack.cs <span style='color:#111;'> 1.91KB </span>","children":null,"spread":false},{"title":"GameOfTwoStacks.cs <span style='color:#111;'> 3.98KB </span>","children":null,"spread":false}],"spread":true},{"title":"Trees","children":[{"title":"Traversal.cs <span style='color:#111;'> 744B </span>","children":null,"spread":false}],"spread":true},{"title":"LinkedLists","children":[{"title":"DoublyLinkedListReverse.cs <span style='color:#111;'> 925B </span>","children":null,"spread":false}],"spread":true}],"spread":true},{"title":"Codility","children":[{"title":"CodilityTest.cs <span style='color:#111;'> 2.13KB </span>","children":null,"spread":false}],"spread":true},{"title":"Algorithms","children":[{"title":"Stacks","children":[{"title":"InfixToPrefix.cs <span style='color:#111;'> 4.22KB </span>","children":null,"spread":false},{"title":"InfixToPostfix.cs <span style='color:#111;'> 4.05KB </span>","children":null,"spread":false},{"title":"StackTest.cs <span style='color:#111;'> 3.56KB </span>","children":null,"spread":false}],"spread":true},{"title":"Trees","children":[{"title":"Insert.cs <span style='color:#111;'> 1.34KB </span>","children":null,"spread":false}],"spread":true},{"title":"LinkedLists","children":[{"title":"LinkedListTest.cs <span style='color:#111;'> 1.80KB </span>","children":null,"spread":false}],"spread":true}],"spread":true}],"spread":true}],"spread":true}],"spread":true}]