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

Escape HTML whitespace

Escape white space with %20 in place

def htmlEncode(ch: Array[Char]) = {
  var spaces = 0
  for (c <- ch) {
    if (c == ' ')
      spaces += 1
  }
  val newLength = ch.length + 2 * spaces
  ch(newLength) = '\0'
  for (i <- ch.length - 1 to 0 by -1) {
    if (ch(i) == ' ') {
      ch(newLength - 1) = ch(i)
      ch(newLength - 2) = ch(i - 1)
      ch(newLength - 3) = ch(i - 2)
      newLength - 3
    } else {
      ch(newLength - 1) = ch(i)
      newLength - 1
    }
  }
}

PreviousCompress String by Character CountNextCheck String Permutation

Last updated 6 years ago