Bernard Wong
  • Software Engineer
  • Problems
    • Lowest Common Ancestor of a Binary Tree
    • Longest Substring Without Repeating Characters
    • Longest Palindromic Substring
    • Longest Common Prefix
    • Isomorphic Strings
    • Integer to Roman
    • Frog Jump
    • Find the Difference
    • Find k closest elements to a given value
    • Longest Common Subsequence
    • Binary Search Tree from Sorted Array
    • Balanced Binary Tree
    • Sort Using Two Stacks
    • O(1) Stack
    • k-th element to last of a LinkedList
    • Dedup LinkedList
    • Check Rotated String
    • Compress String by Character Count
    • Escape HTML whitespace
    • Check String Permutation
    • Unique String
    • Container With Most Water
    • 4 Sum
    • 3 Sum Closest
    • 3 Sum
    • 2 Sum
    • Maximum Subarray
    • Nested List Weight Sum
    • Palindrome Number
    • Pow(x, n)
    • Regular Expression Matching
    • Remove Nth Node From End of List
    • Reverse Integer
    • Roman to Integer
    • Rotate Array
    • Search a 2D Matrix
    • Shortest Word Distance
    • Two Sum III - Data structure design
    • Valid Parentheses
    • ZigZag Conversion
    • Quicksort
    • Add Two Numbers
    • Best Time to Buy and Sell Stock
    • Letter Combinations of a Phone Number
  • Data Structures
    • Heap
Powered by GitBook
On this page
  1. Problems

Sort Using Two Stacks

Write a program to sort a stack using additional stacks but no other data structures

import scala.collection.mutable.Stack

/**
  * 3.6
  * @param s1
  * @return
  */
def sort(s1:Stack[Int]): Stack[Int] = {
  val s2 = Stack[Int]()
  while (!s1.isEmpty) {
    val tmp = s1.pop()
    while (!s2.isEmpty && s2.head < tmp) {
      s1.push(s2.pop())
    }
    s2.push(tmp)
  }
  s2
}

val s = Stack[Int]()
s.push(3)
s.push(9)
s.push(5)

val s3 = sort(s)
while (!s3.isEmpty) {
  println(s3.pop())
}

PreviousBalanced Binary TreeNextO(1) Stack

Last updated 6 years ago