Skip to main content

[Interview]: URLify

[Interview] URLify:



--------------------------------------------------------------------------------------------------------------------------


Question:


URLify:
Write a method to replace all spaces in a string with
‘%20’, you may assume that the string has sufficient space at the
end to hold the additional characters.


Example 
input: 'mr john smith ' 
output: 'mr%20john%20smith'

-------------------------------------------------------------------------------------------------------------------------- 

Idea 1: 
Start from the back and start replacing until the character is not ' ', and replace the characters in reverse order.

Solution 1:
public class Solution{
 public String replace(char[] str) {
  boolean flag = false;
  StringBuffer sb = new StringBuffer();
  for (int i = str.length - 1; i >= 0; i--) {
   if (str[i] != ' ')
    flag = true;

   if (flag == true) {

    if (str[i] == ' ') {
     sb.append('0');
     sb.append('2');
     sb.append('%');

    } else {
     sb.append(str[i]);
    }

   }
  }
  return sb.reverse().toString();
 }

}
--------------------------------------------------------------------------------------------------------------------------
Video Explanation:






Comments

  1. Play casino - No.1 for the Casino Guru
    No longer have the opportunity to go to worrione.com the titanium earrings casinos or read 출장샵 the reviews of the slots you love. https://deccasino.com/review/merit-casino/ But they're not always the same. Sometimes you have a new online https://sol.edu.kg/

    ReplyDelete

Post a Comment

Popular posts from this blog

[LeetCode Solution 230]: Kth Smallest Element in a BST

Question: Given a binary search tree, write a function  kthSmallest  to find the  k th smallest element in it. ************************************************************************************************************************************ Write Infront To read to a tutorial, please to read the tutorial of in-order traversal of BST, please check: LeetCode Solution 94: Binary Tree Inorder Traversal We are going to solve this question using the following 4 methods: ->Binary Search ->Recursive ->Iterative ->Morris  Approach #1 Binary Search [Accepted] Detail Explanation The first method to solve this problem is using Binary Search. The idea is very easy and extremely to think. We use BST's property that the left child of the root is smaller than the root while the right child of the root is always bigger. We consider that the root is the pivot, and find the number of the nodes in the left subtree and the number of the nodes in th

[LeetCode Solution 145] Binary Tree Postorder Traversal

[LeetCode Solution 145]: Binary Tree Postorder Traversal Question: Given a binary tree, return the  postorder  traversal of its nodes' values. For example: Given binary tree  {1,#,2,3} , 1 \ 2 / 3 return  [3,2,1] . Approach #1 Recursive [Accepted] Detail Explanation The first method to solve this problem is using recursive. This is the classical method and straightforward. we can define a helper function to implement recursion. The java code is as follows: Java public class Solution { public List<Integer> postorderTraversal (TreeNode root) { List<Integer> res = new ArrayList<>(); helper(root, res); return res; } public void helper (TreeNode root, List<Integer> res) { if (root != null ) { if (root.left != null ) { helper(root.left, res); } if (root.right != null ) { helper(root.right, res); } res.add(root.val); } } } Complexity Analysis Time complexity :