zoukankan
html css js c++ java
11 栈的使用例子 进制转换
十进制转换为八进制：
算法：除八取余法，然后按倒序将余数串起来就是对应的八进制数。
利用栈后进先出的特点，获取余数序列的倒序输出，即可得到八进制数。
括号匹配的检验：
表达式求值：
算符优先算法
查看全文
相关阅读:
11. Container With Most Water
9. Palindrome Number
375. 猜数字大小 II leetcode java
leetcode 72 编辑距离 JAVA
73. 矩阵置零 leetcode JAVA
快速排序 JAVA实现
63. 不同路径 II leetcode JAVA
重写(override)与重载(overload)
62 不同路径 leetcode JAVA
leetcode 56 合并区间 JAVA
原文地址：https://www.cnblogs.com/CPU-Easy/p/11712852.html
最新文章
[LeetCode] 1381. Design a Stack With Increment Operation
[LeetCode] 1609. Even Odd Tree
[LeetCode] 1660. Correct a Binary Tree
[LeetCode] 1492. The kth Factor of n
[LeetCode] 742. Closest Leaf in a Binary Tree
[LeetCode] 659. Split Array into Consecutive Subsequences
[LeetCode] 897. Increasing Order Search Tree
[LeetCode] 426. Convert Binary Search Tree to Sorted Doubly Linked List
[LeetCode] 382. Linked List Random Node
[LeetCode] 1325. Delete Leaves With a Given Value
热门文章
[LeetCode] 814. Binary Tree Pruning
[LeetCode] 1010. Pairs of Songs With Total Durations Divisible by 60
19. Remove Nth Node From End of List
18. 4Sum
17. Letter Combinations of a Phone Number
16. 3Sum Closest
15. 3Sum
14. Longest Common Prefix
13. Roman to Integer
12. Integer to Roman
Copyright © 2011-2022 走看看
